The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
The Capacity of Robust Private Information Retrieval With Colluding Databases
Open accessAbstract
Private information retrieval (PIR) is the problem of retrieving as efficiently as possible, one out of K messages from N non-communicating replicated databases (each holds all K messages) while keeping the identity of the desired message index a secret from each individual database. The information theoretic capacity of PIR (equivalently, the reciprocal of minimum download cost) is the maximum number of bits of desired information that can be privately retrieved per bit of downloaded information. T-private PIR is a generalization of PIR to include the requirement that even if any T of the N databases collude, the identity of the retrieved message remains completely unknown to them. Robust PIR is another generalization that refers to the scenario where we have M ≥ N databases, out of which any M-N may fail to respond. For K messages and M ≥ N databases out of which at least some N must respond, we show that the capacity of T-private and Robust PIR is (1 + T/N + T2/N2+ · · · + TK-1/NK-1)-1. The result includes as special cases the capacity of PIR without robustness (M = N) or T-privacy constraints (T = 1).
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2005) · doi:10.1002/047174882x · Cited by 13,791
Shamir, A. (1979) · Communications of the ACM · doi:10.1145/359168.359176 · Cited by 13,756
Ahlswede, R., Cai, N., Li, S.-Y. R., & Yeung, R. W. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.850663 · Cited by 7,814
Chor, B., Kushilevitz, E., Goldreich, O., & Sudan, M. (1998) · Journal of the ACM · doi:10.1145/293347.293350 · Cited by 1,612
Chor, B., Goldreich, O., Kushilevitz, E., & Sudan, M. (2002) · Proceedings of IEEE 36th Annual Foundations of Computer Science · doi:10.1109/sfcs.1995.492461 · Cited by 1,116
On the Locality of Codeword Symbols
Gopalan, P., Huang, C., Simitci, H., & Yekhanin, S. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2012.2208937 · Cited by 831
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
Self-citationProtecting data privacy in private information retrieval schemes
Gertner, Y., Ishai, Y., Kushilevitz, E., & Malkin, T. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276723 · Cited by 445
Birk, Y., & Kol, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.874540 · Cited by 324
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
Hiding instances in multioracle queries
Beaver, D., & Feigenbaum, J. (1990) · Lecture Notes in Computer Science · doi:10.1007/3-540-52282-4_30 · Cited by 235
Batch codes and their applications
Ishai, Y., Kushilevitz, E., Ostrovsky, R., & Sahai, A. (2004) · Proceedings of the thirty-sixth annual ACM symposium on Theory of computing · doi:10.1145/1007352.1007396 · Cited by 227
Breaking the O(n/sup 1/(2k-1)/) barrier for information-theoretic Private Information Retrieval
Beimel, A., Ishai, Y., Kushilevitz, E., & Raymond, J.-F. (2003) · The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings. · doi:10.1109/sfcs.2002.1181949 · Cited by 218
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
Upper bound on the communication complexity of private information retrieval
Ambainis, A. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-63165-8_196 · Cited by 172
Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing
Beimel, A., Ishai, Y., & Malkin, T. (2000) · Lecture notes in computer science · doi:10.1007/3-540-44598-6_4 · Cited by 142
Private information retrieval for coded storage
Chan, T. H., Ho, S.-W., & Yamamoto, H. (2015) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2015.7282975 · Cited by 136
General constructions for information-theoretic private information retrieval
Beimel, A., Ishai, Y., & Eyal Kushilevitz, Z. (2005) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2005.03.002 · Cited by 107
On hiding information from an oracle
Abadi, M., Feigenbaum, J., & Kilian, J. (1987) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/28395.28417 · Cited by 87
Private information retrieval from MDS coded data in distributed storage systems
Tajeddine, R., & Rouayheb, S. E. (2016) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2016.7541531 · Cited by 87
Locally random reductions: Improvements and applications
Beaver, D., Feigenbaum, J., Kilian, J., & Rogaway, P. (1997) · Journal of Cryptology · doi:10.1007/s001459900017 · Cited by 73
Share Conversion and Private Information Retrieval
Beimel, A., Ishai, Y., Kushilevitz, E., & Orlov, I. (2012) · IEEE Conference on Computational Complexity (CCC) · doi:10.1109/ccc.2012.23 · Cited by 68
Robust Information-Theoretic Private Information Retrieval
Beimel, A., & Stahl, Y. (2007) · Journal of Cryptology · doi:10.1007/s00145-007-0424-2 · Cited by 62
A Random Server Model for Private Information Retrieval
Gertner, Y., Goldwasser, S., & Malkin, T. (1998) · Lecture notes in computer science · doi:10.1007/3-540-49543-6_17 · Cited by 55
Locally Decodable Codes and Private Information Retrieval Schemes
Yekhanin, S. (2010) · Information security and cryptography · doi:10.1007/978-3-642-14358-8 · Cited by 51
Efficient Private Information Retrieval Over Unsynchronized Databases
Fanti, G. C., & Ramchandran, K. (2015) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2015.2432740 · Cited by 35
Feigenbaum, J. (2007) · Springer eBooks · doi:10.1007/3-540-39799-x_38 · Cited by 34
Cited by
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
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
- Sun, H., & Jafar, S. A.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2018-04
- Volume
- 64
- Issue
- 4
- Pages
- 2361-2370
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2768218911
- Cited by
- 312
- References
- 31
- FWCI
- 26.24
- 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
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.