The DOI matches its Crossref record.
One extra bit of download ensures perfectly private information retrieval
Abstract
Private information retrieval (PIR) systems allow a user to retrieve a record from a public database without revealing to the server which record is being retrieved. The literature on PIR considers only replication-based systems, wherein each storage node stores a copy of the entire data. However, systems based on erasure codes are gaining increasing popularity due to a variety of reasons. This paper initiates an investigation into PIR in erasure-coded systems by establishing its capacity and designing explicit codes and algorithms. The notion of privacy considered here is information-theoretic, and the metric optimized is the amount of data downloaded by the user during PIR. In this paper, we present four main results. First, we design an explicit erasure code and PIR algorithm that requires only one extra bit of download to provide perfect privacy. In contrast, all existing PIR algorithms require a download of at least twice the size of the requisite data. Second, we derive lower bounds proving the necessity of downloading at least one additional bit. This establishes the precise capacity of PIR with respect to the metric of download. These results are also applicable to PIR in replication-based systems, which are a special case of erasure codes. Our third contribution is a negative result showing that capacity-achieving codes necessitate super-linear storage overheads. This motivates the fourth contribution of this paper: an erasure code and PIR algorithm that requires a linear storage overhead, provides high reliability to the data, and is a small factor away from the capacity.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
The Capacity of Private Information Retrieval
Sun, H., & Jafar, S. A. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2689028 · Cited by 447
The Capacity of Private Information Retrieval From Coded Databases
Banawan, K., & Ulukus, S. (2018) · IEEE Transactions on Information Theory · doi:10.1109/tit.2018.2791994 · Cited by 362
The Capacity of Robust Private Information Retrieval With Colluding Databases
Sun, H., & Jafar, S. A. (2018) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2777490 · Cited by 312
Private information retrieval with side information: The single server case
Kadhe, S., Garcia, B., Heidarzadeh, A., Rouayheb, S. E., & Sprintson, A. (2017) · 2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton) · doi:10.1109/allerton.2017.8262860 · Cited by 38
Staircase-PIR: Universally Robust Private Information Retrieval
Bitar, R., & Rouayheb, S. E. (2018) · 2018 IEEE Information Theory Workshop (ITW) · doi:10.1109/itw.2018.8613532 · Cited by 27
Metadata
- Authors
- Shah, N. B., Rashmi, K. V., & Ramchandran, K.
- Venue
- 2014 IEEE International Symposium on Information Theory
- Publisher
- IEEE
- Published
- 2014-06
- Pages
- 856-860
- OpenAlex
- W2007725949
- Cited by
- 201
- References
- 0
- FWCI
- 8.10
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: One extra bit of download ensures perfectly private information retrieval. https://app.cochat.ai/papers/10.1109/isit.2014.6874954
- The paper
- Shah, N. B., Rashmi, K. V., & Ramchandran, K. (2014). One extra bit of download ensures perfectly private information retrieval. 2014 IEEE International Symposium on Information Theory. https://doi.org/10.1109/isit.2014.6874954
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.