• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

A survey on private information retrieval (2004)

Cached

  • Download as a PDF

Download Links

  • [www.cs.umd.edu]
  • [www.cs.umd.edu]
  • [www.cs.umd.edu]
  • [cgis.cs.umd.edu]
  • [www.cs.umd.edu]
  • [www.cs.umd.edu]
  • [www.cs.umd.edu]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by William Gasarch
Venue:Bulletin of the EATCS
Citations:44 - 1 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@ARTICLE{Gasarch04asurvey,
    author = {William Gasarch},
    title = {A survey on private information retrieval},
    journal = {Bulletin of the EATCS},
    year = {2004},
    volume = {82},
    pages = {72--107}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

Alice wants to query a database but she does not want the database to learn what she is querying. She can ask for the entire database. Can she get her query answered with less communication? One model of this problem is Private Information Retrieval, henceforth PIR. We survey results obtained about the PIR model including partial answers to the following questions. (1) What if there are k non-communicating copies of the database but they are computationally unbounded? (2) What if there is only one copy of the database and it is computationally bounded? 1

Keyphrases

private information retrieval    non-communicating copy    entire database    survey result    henceforth pir    partial answer    following question    pir model   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

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

© 2007-2019 The Pennsylvania State University