• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Private Information Retrieval (1997)

Cached

  • Download as a PDF
  •  
  • Download as a PS

Download Links

  • [www.wisdom.weizmann.ac.il]
  • [www.wisdom.weizmann.ac.il]
  • [theory.lcs.mit.edu]
  • [www.cs.technion.ac.il]
  • [cgis.cs.umd.edu]
  • [www.cs.umd.edu]
  • [www.cs.umd.edu]
  • [www.cs.umd.edu]
  • [ftp.wisdom.weizmann.ac.il]
  • [theory.lcs.mit.edu]
  • [www.cs.technion.ac.il]
  • [www.freehaven.net]
  • [www.cs.technion.ac.il]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Benny Chor , Oded Goldreich , Eyal Kushilevitz , Madhu Sudan
Citations:347 - 10 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

Versions

  • Version 0
  • Version 1

Version History

Metadata Version 1

User correction supplied by mph

DatumValueSource
TITLE Private Information Retrieval user correction
AUTHOR NAME Benny Chor user correction
AUTHOR NAME Oded Goldreich user correction
AUTHOR AFFIL Computer Science and Applied Math. Dept., Weizmann Institute of Science user correction
AUTHOR ADDR Rehovot, Israel user correction
AUTHOR NAME Eyal Kushilevitz user correction
AUTHOR NAME Madhu Sudan user correction
AUTHOR AFFIL IBM Research Division, T.J. Watson Research Center user correction
AUTHOR ADDR P.O. Box 218, Yorktown Heights, NY 10598 user correction
ABSTRACT Publicly accessible databases are an indispensable resource for retrieving up to date information. But they also pose a significant risk to the privacy of the user, since a curious database operator can follow the user's queries and infer what the user is after. Indeed, in cases where the users ' intentions are to be kept secret, users are often cautious about accessing the database. It can be shown that when accessing a single database, to completely guarantee the privacy of the user, the whole database should be downloaded, namely n bits should be communicated (where n is the number of bits in the database). In this work, we investigate whether by replicating the database, more efficient solutions to the private retrieval problem can be obtained. We describe schemes that enable a user to access k replicated copies of a database (k * 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. Our schemes use the replication to gain substantial saving. In particular, we have ffl A two database scheme with communication complexity of O(n1=3). ffl A scheme for a constant number, k, of databases with communication complexity O(n1=k). ffl A scheme for 13 log2 n databases with polylogarithmic (in n) communication complexity. user correction
YEAR 1997 SVM HeaderParse 0.2
CITATIONS 15 found ParsCit 1.0
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University