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.
CITATION STYLE
Ispoglou, K., Makris, C., Stamatiou, Y. C., Stavropoulos, E. C., Tsakalidis, A. K., & Iosifidis, V. (2015). Partial order preserving encryption search trees. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9262, pp. 49–56). Springer Verlag. https://doi.org/10.1007/978-3-319-22852-5_5
Mendeley helps you to discover research relevant for your work.