Oblivious Search and Updates for Outsourced Tree-Structured Data on Untrusted Servers

Although tree-based index structures, such as B+ -trees, R-trees, have proven their advantages to both traditional and modern database applications, they introduce numerous research challenges as database services are outsourced to untrusted servers. In the outsourced database service (ODBS) model, the crucial security research questions mainly relate to data confidentiality, data and user privacy, authentication and data integrity. To the best of our knowledge, however, none of the previous research has radically addressed the problem of pr eserving privacy for basic operations on such outsourced search trees. Basic operations of search trees/tree-based index structures include search (to answer different types of queries) and updates (modification, insert, delete). In this paper, we will discuss security issues in outsourced databases that come together with search trees, and present techniques to ensure privacy in the execution of these trees’ basic operations on the untrusted server. Our techniques allow clients to operate on their outsourced tree-structured data on untrusted servers without revealing information about the query, result, and the outsourced data itself.

[1]  Wenliang Du,et al.  Protocols for Secure Remote Database Access with Approximate Matching , 2001, E-Commerce Security and Privacy.

[2]  Antonin Guttman,et al.  R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.

[3]  Shin'ichi Satoh,et al.  The SR-tree: an index structure for high-dimensional nearest neighbor queries , 1997, SIGMOD '97.

[4]  Luc Bouganim,et al.  Chip-Secured Data Access: Confidential Data on Untrusted Servers , 2002, VLDB.

[5]  Eyal Kushilevitz,et al.  Private information retrieval , 1998, JACM.

[6]  Silvana Castano,et al.  Database Security , 1997, IFIP Advances in Information and Communication Technology.

[7]  Nick Roussopoulos,et al.  Faloutsos: "the r+- tree: a dynamic index for multidimensional objects , 1987 .

[8]  Christos Faloutsos,et al.  The R+-Tree: A Dynamic Index for Multi-Dimensional Objects , 1987, VLDB.

[9]  Yuval Ishai,et al.  Protecting data privacy in private information retrieval schemes , 1998, STOC '98.

[10]  Michael Mitzenmacher,et al.  Privacy Preserving Keyword Searches on Remote Encrypted Data , 2005, ACNS.

[11]  Christian Böhm,et al.  Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases , 2001, CSUR.

[12]  Kenny Fong,et al.  Potential Security Holes in Hacıgümüş ’ Scheme of Executing SQL over Encrypted Data , 2003 .

[13]  Sushil Jajodia,et al.  Implementation of a Storage Mechanism for Untrusted DBMSs , 2003, Second IEEE International Security in Storage Workshop.

[14]  Johann-Christoph Freytag,et al.  Repudiative information retrieval , 2002, WPES '02.

[15]  Ricardo A. Baeza-Yates,et al.  Searching in metric spaces , 2001, CSUR.

[16]  Sean W. Smith,et al.  Secure coprocessing applications and research issues , 1996 .

[17]  Sean W. Smith,et al.  Practical server privacy with secure coprocessors , 2001, IBM Syst. J..

[18]  Rudolf Bayer,et al.  The Universal B-Tree for Multidimensional Indexing: general Concepts , 1997, WWCA.

[19]  Dmitri Asonov.  Private Information Retrieval – An Overview and Current Trends , 2001 .

[20]  Rafail Ostrovsky,et al.  Software protection and simulation on oblivious RAMs , 1996, JACM.

[21]  Gene Tsudik,et al.  Authentication and integrity in outsourced databases , 2006, TOS.

[22]  Dawn Xiaodong Song,et al.  Practical techniques for searches on encrypted data , 2000, Proceeding 2000 IEEE Symposium on Security and Privacy. S&P 2000.

[23]  Hakan Hacigümüs,et al.  Executing SQL over encrypted data in the database-service-provider model , 2002, SIGMOD '02.

[24]  Dennis Shasha,et al.  B-Trees with Inserts and Deletes: Why Free-at-Empty Is Better Than Merge-at-Half , 1993, J. Comput. Syst. Sci..

[25]  Ramesh C. Jain,et al.  Similarity indexing with the SS-tree , 1996, Proceedings of the Twelfth International Conference on Data Engineering.

[26]  Sharad Mehrotra,et al.  The hybrid tree: an index structure for high dimensional feature spaces , 1999, Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337).

[27]  Hakan Hacigümüs,et al.  Providing database as a service , 2002, Proceedings 18th International Conference on Data Engineering.

[28]  Jeffrey F. Naughton,et al.  Generalized Search Trees for Database Systems , 1995, VLDB.

[29]  K. Selçuk Candan,et al.  Hiding Traversal of Tree Structured Data from Untrusted Data Stores , 2003, ISI.

[30]  Sushil Jajodia,et al.  Balancing confidentiality and efficiency in untrusted relational DBMSs , 2003, CCS '03.

[31]  Tran Khanh Dang,et al.  The SH-tree: A Super Hybrid Index Structure for Multidimensional Data , 2001, DEXA.

[32]  Tran Khanh Dang.  Semantic Based Similarity Searches in Database Systems (Multidimensional Access Methods, Similarity Search Algorithms) , 2003 .

[33]  Hans-Peter Kriegel,et al.  The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.

[34]  Tran Khanh Dang.  Extreme Security Protocols for Outsourcing Database Services , 2004, iiWAS.

[35]  Oliver Günther,et al.  Multidimensional access methods , 1998, CSUR.