Advertisement
Published in:
2015 | OriginalPaper | Chapter
Partial Order Preserving Encryption Search Trees
Authors : Kyriakos Ispoglou, Christos Makris, Yannis C. Stamatiou, Elias C. Stavropoulos, Athanasios K. Tsakalidis, Vasileios Iosifidis
Published in: Database and Expert Systems Applications
Publisher: Springer International Publishing
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Abstract
As Internet services expand and proliferate, service users’ data show an increase in volume as well as geographical dispersion mainly due to the large number of personalized services that users often access today on a daily basis. This fact, however, presents a user privacy and user data security challenge for service providers: how to protect theirs users’ data from unauthorized access. In this paper we present a new tree-based data structure for storing encrypted information in order to support fast search, update, and delete operations on the encrypted data. The data structure relies on exposing limited ordering information of the data in order to locate them fast. After showing that a totally order preserving encryption scheme is not secure, we describe a new tree data structure and assess its security and efficiency.