The Community for Technology Leaders
RSS Icon
Subscribe
Milwaukee, Wisconsin
Oct. 23, 1995 to Oct. 25, 1995
ISBN: 0-8186-7183-1
pp: 41
O. Goldreich , Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel
B. Chor , Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel
M. Sudan , Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel
ABSTRACT
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
O. Goldreich, B. Chor, M. Sudan, "Private information retrieval", FOCS, 1995, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science 1995, pp. 41, doi:10.1109/SFCS.1995.492461
30 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool