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 language | English |
|---|---|
| Pages (from-to) | 125-151 |
| Number of pages | 27 |
| Journal | Journal of Cryptology |
| Volume | 17 |
| Issue number | 2 |
| DOIs | |
| State | Published - 1 Mar 2004 |
Keywords
- Distributed databases
- Information-theoretic protocols
- Privacy
- Sub-linear communication
- Sub-linear computation
ASJC Scopus subject areas
- Software
- Computer Science Applications
- Applied Mathematics
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
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver