This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
36th Annual Symposium on Foundations of Computer Science (FOCS'95)
Private information retrieval
Milwaukee, Wisconsin
October 23-October 25
ISBN: 0-8186-7183-1
B. Chor, Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel
O. Goldreich, Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel
E. Kushilevitz, Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel
M. Sudan, Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel
We describe schemes that enable a user to access k replicated copies of a database (k/spl ges/2) and privately retrieve information stored in the database. This means that each individual database gets no information on the identity of the item retrieved by the user. For a single database, achieving this type of privacy requires communicating the whole database, or n bits (where n is the number of bits in the database). Our schemes use the replication to gain substantial saving. In particular, we have: A two database scheme with communication complexity of O(n/sup 1/3/). A scheme for a constant number, k, of databases with communication complexity O(n/sup 1/k/). A scheme for 1/3 log/sub 2/ n databases with polylogarithmic (in n) communication complexity.
Index Terms:
communication complexity; replicated databases; database theory; information retrieval; replicated copies; privacy; communication complexity; replication
Citation:
B. Chor, O. Goldreich, E. Kushilevitz, M. Sudan, "Private information retrieval," focs, pp.41, 36th Annual Symposium on Foundations of Computer Science (FOCS'95), 1995
Usage of this product signifies your acceptance of the Terms of Use.