The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
The Capacity of Private Information Retrieval From Coded Databases
Open accessAbstract
We consider the problem of private information retrieval (PIR) over a distributed storage system. The storage system consists of N non-colluding databases, each storing an MDS-coded version of M messages. In the PIR problem, the user wishes to retrieve one of the available messages without revealing the message identity to any individual database. We derive the information-theoretic capacity of this problem, which is defined as the maximum number of bits of the desired message that can be privately retrieved per one bit of downloaded information. We show that the PIR capacity in this case is C = (1 + K/N + K2/N2+ ⋯ + KM-1/NM-1)-1= (1 + Rc+ Rc2+ ⋯ + RcM-1)-1= (1 - Rc)/(1 - RcM), where Rcis the rate of the (N, K) MDS code used. The capacity is a function of the code rate and the number of messages only regardless of the explicit structure of the storage code. The result implies a fundamental tradeoff between the optimal retrieval cost and the storage cost when the storage code is restricted to the class of MDS codes. The result generalizes the achievability and converse results for the classical PIR with replicated databases to the case of MDS-coded databases.
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
Cites
Chor, B., Kushilevitz, E., Goldreich, O., & Sudan, M. (1998) · Journal of the ACM · doi:10.1145/293347.293350 · Cited by 1,612
A Survey on Network Codes for Distributed Storage
Dimakis, A. G., Ramchandran, K., Wu, Y., et al. (2011) · Proceedings of the IEEE · doi:10.1109/jproc.2010.2096170 · Cited by 639
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 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
A Survey of Single-Database Private Information Retrieval: Techniques and Applications
Ostrovsky, R., & Skeith, W. E. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-71677-8_26 · Cited by 246
Jafar, S. A. (2012) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2012.2187877 · Cited by 224
A Survey on Private Information Retrieval
Gasarch, W. I. (2004) · Cited by 207
Yekhanin, S. (2010) · Communications of the ACM · doi:10.1145/1721654.1721674 · Cited by 202
One extra bit of download ensures perfectly private information retrieval
Shah, N. B., Rashmi, K. V., & Ramchandran, K. (2014) · 2014 IEEE International Symposium on Information Theory · doi:10.1109/isit.2014.6874954 · Cited by 201
1Private Information Retrieval for Coded StoragePreprint
Chan, T., Ho, S., & Yamamoto, H. (2016) · Cited by 173
Cited by
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
- Banawan, K., & Ulukus, S.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2018-03
- Volume
- 64
- Issue
- 3
- Pages
- 1945-1956
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2524023279
- Cited by
- 362
- References
- 13
- FWCI
- 31.68
- Type
- journal article
- Language
- en
- Open access
- green
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: The Capacity of Private Information Retrieval From Coded Databases. https://app.cochat.ai/papers/10.1109/tit.2018.2791994
- The paper
- Banawan, K., & Ulukus, S. (2018). The Capacity of Private Information Retrieval From Coded Databases. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2018.2791994
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.