Partial Order Preserving Encryption Search Trees

• Published in: Database and Expert Systems Applications pp. 49 - 56
• Main Authors: Ispoglou, Kyriakos, Makris, Christos, Stamatiou, Yannis C., Stavropoulos, Elias C., Tsakalidis, Athanasios K., Iosifidis, Vasileios
• Format: Book Chapter
• Language: English
• Published: Cham Springer International Publishing
• Series: Lecture Notes in Computer Science
• ISBN: 331922851X; 9783319228518
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-319-22852-5_5

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.