Relational-Complete Private Information Retrieval

We show how relational algebra queries can be processed over relational databases encoded for private information retrieval. In particular, we illustrate how each of the constructs for relational algebra can be compiled into an online stream of private information retrieval requ sts. This brings relational-complete query capabilities to traditional private information retrieval schemes, whi ch gives greater utility to a private information retriever without impacting her privacy. Our proposed design is for the layout of data inside a private d abase, including index structures, and thus can be implemented using any block-based private information r etrieval scheme. We detail how the client converts a relational algebra query into a sequence of private request s, with the goal of minimizing network traffic.

[1]  E. F. Codd,et al.  Relational Completeness of Data Base Sublanguages , 1972, Research Report / RJ / IBM / San Jose, California.

[2]  Raghu Ramakrishnan,et al.  Database Management Systems , 1976 .

[3]  E. F. Codd,et al.  The Relational Model for Database Management, Version 2 , 1990 .

[4]  Rafail Ostrovsky,et al.  Private Information Storage , 1996, IACR Cryptol. ePrint Arch..

[5]  Niv Gilboa,et al.  Computationally private information retrieval (extended abstract) , 1997, STOC '97.

[6]  Tal Malkin,et al.  A Random Server Model for Private Information Retrieval or How to Achieve Information Theoretic PIR Avoiding Database Replication , 1998, RANDOM.

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

[8]  Moni Naor,et al.  Private Information Retrieval by Keywords , 1998, IACR Cryptol. ePrint Arch..

[9]  Surajit Chaudhuri,et al.  An overview of query optimization in relational systems , 1998, PODS.

[10]  F. E.,et al.  A Relational Model of Data Large Shared Data Banks , 2000 .

[11]  Michael A. Bender,et al.  Cache-oblivious B-trees , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[12]  David Thomas,et al.  The Art in Computer Programming , 2001 .

[13]  George Danezis,et al.  Mixminion: design of a type III anonymous remailer protocol , 2003, 2003 Symposium on Security and Privacy, 2003..

[14]  Nick Mathewson,et al.  Tor: The Second-Generation Onion Router , 2004, USENIX Security Symposium.

[15]  Dawn Xiaodong Song,et al.  Private Keyword-Based Push and Pull with Applications to Anonymous Communication , 2004, ACNS.

[16]  Nick Mathewson,et al.  The pynchon gate: a secure method of pseudonymous mail retrieval , 2005, WPES '05.

[17]  Michael O. Rabin,et al.  How To Exchange Secrets with Oblivious Transfer , 2005, IACR Cryptol. ePrint Arch..

[18]  Felipe Saint-Jean.  Java Implementation of a Single-Database Computationally Symmetric Private Information Retrieval (cSPIR) Protocol , 2005 .

[19]  Ian Goldberg,et al.  Improving the Robustness of Private Information Retrieval , 2007 .

[20]  Amos Beimel,et al.  Robust Information-Theoretic Private Information Retrieval , 2002, Journal of Cryptology.

[21]  Scott Boag,et al.  XQuery 1.0 : An XML Query Language , 2007 .