Reducing the servers' computation in private information retrieval: PIR with preprocessing

Amos Beimel, Yuval Ishai, Tal Malkin

Research output: Contribution to journalArticlepeer-review

42 Scopus citations

Abstract

The computational complexity of private information retrieval (PIR) was studied. It was shown that in the standard PIR model, where the servers hold only the database, linear computation cannot be avoided. Substantial savings in the amount of computation without severely affecting the communication complexity are obtained by using preprocessing in PIR protocols. Two alternative models to saving computation, by batching queries and by allowing a separate off-line interaction per future query were suggested.

Original languageEnglish
Pages (from-to)125-151
Number of pages27
JournalJournal of Cryptology
Volume17
Issue number2
DOIs
StatePublished - 1 Mar 2004

Keywords

  • Distributed databases
  • Information-theoretic protocols
  • Privacy
  • Sub-linear communication
  • Sub-linear computation

Fingerprint

Dive into the research topics of 'Reducing the servers' computation in private information retrieval: PIR with preprocessing'. Together they form a unique fingerprint.

Cite this