Advertisement

Partial Order Preserving Encryption Search Trees

  • Kyriakos Ispoglou
  • Christos Makris
  • Yannis C. Stamatiou
  • Elias C. Stavropoulos
  • Athanasios K. Tsakalidis
  • Vasileios Iosifidis
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9262)

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.

Notes

Acknowledgment

Research partially done while the third author was on Sabbatical leave (Spring-Summer 2015) at the Department of Business Informatics, Faculty of Economics and Business Administration, Goethe University, Frankfurt, Germany.

References

  1. 1.
    Agrawal, R., Kiernan, J., Srikant, R., Xu, Y.: Order preserving encryption for numeric data. In: Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data (SIGMOD 2004), pp. 563–574, ACM (2014)Google Scholar
  2. 2.
    Bjones, R., Krontiris, I., Paillier, P., Rannenberg, K.: Integrating anonymous credentials with eIDs for privacy-respecting online authentication. In: Preneel, B., Ikonomou, D. (eds.) APF 2012. LNCS, vol. 8319, pp. 111–124. Springer, Heidelberg (2014)Google Scholar
  3. 3.
    Brands, S.: Rethinking Public Key Infrastructures and Digital Certificates: Building in Privacy, 1st edn. The MIT Press, Cambridge (2000)Google Scholar
  4. 4.
    Camenisch, J., Groß, T.: Efficient attributes for anonymous credentials. In: Proceedings ACM Conference on Computer and Communications Security, pp. 345–356, ACM (2008)Google Scholar
  5. 5.
    Ozsoyoglu, S.C., Singer, D.: Anti-tamper databases: querying encrypted databases. In: Proceedings of the 17th Annual IFIP WG 11.3 Working Conference on Database and Applications Security (2003)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Kyriakos Ispoglou
    • 1
  • Christos Makris
    • 1
  • Yannis C. Stamatiou
    • 2
    • 3
  • Elias C. Stavropoulos
    • 1
    • 4
  • Athanasios K. Tsakalidis
    • 1
  • Vasileios Iosifidis
    • 1
  1. 1.Computer Engineering and Informatics DepartmentUniversity of PatrasRio, PatrasGreece
  2. 2.Department of Business AdministrationUniversity of PatrasRio, PatrasGreece
  3. 3.Computer Technology Institute and Press (“Diophantus”)University of PatrasRio, PatrasGreece
  4. 4.Business Administration DepartmentTechnological Educational Institute of Western GreeceKoukouli, PatrasGreece

Personalised recommendations