The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Private information retrieval
Abstract
We describe schemes that enable a user to access k replicated copies of a database (k/spl ges/2) and privately retrieve information stored in the database. This means that each individual database gets no information on the identity of the item retrieved by the user. For a single database, achieving this type of privacy requires communicating the whole database, or n bits (where n is the number of bits in the database). Our schemes use the replication to gain substantial saving. In particular, we have: A two database scheme with communication complexity of O(n/sup 1/3/). A scheme for a constant number, k, of databases with communication complexity O(n/sup 1/k/). A scheme for 1/3 log/sub 2/ n databases with polylogarithmic (in n) communication complexity.
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
Information Theory and Reliable Communication.
Lee, P. M., & Gallager, R. T. (1970) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2344305 · Cited by 5,399
Information Theory and Reliable Communication
Bell, D. A. (1969) · Electronics and Power · doi:10.1049/ep.1969.0319 · Cited by 4,012
Principles of Distributed Database Systems
Özsu, M. T., & Valduriez, P. (2020) · Springer eBooks · doi:10.1007/978-3-030-26253-2 · Cited by 2,345
Cryptography and data security
Denning, D. E. (1982) · Calhoun: The Naval Postgraduate School Institutional Archive (Naval Postgraduate School) · Cited by 1,904
(1978) · Cited by 1,875
Security-control methods for statistical databases: a comparative study
Adam, N. R., & Worthmann, J. C. (1989) · ACM Computing Surveys · doi:10.1145/76894.76895 · Cited by 969
Checking computations in polylogarithmic time
Babai, L., Fortnow, L., Levin, L. A., & Szegedy, M. (1991) · Proceedings of the twenty-third annual ACM symposium on Theory of computing - STOC '91 · doi:10.1145/103418.103428 · Cited by 616
Non-deterministic exponential time has two-prover interactive protocols
Babai, L., Fortnow, L., & Lund, C. (1992) · Computational Complexity · doi:10.1007/bf01200430 · Cited by 520
Foundations of secure computation
DeMillo, R. A., Lipton, R. J., Dobkin, D., & Jones, A. K. (1978) · SMARTech Repository (Georgia Institute of Technology) · Cited by 462
Non-deterministic exponential time has two-prover interactive protocols
Babai, L., Fortnow, L., & Lund, C. (1991) · Computational Complexity · doi:10.1007/bf01200056 · Cited by 458
Principles of Data Base Systems
Ullman, J. D. (1980) · Cumulative Index of Computer Aided Architectural Design · Cited by 426
Approximating clique is almost NP-complete
Feige, U., Goldwasser, S., Lovasz, L., Safra, S., & Szegedy, M. (2002) · [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science · doi:10.1109/sfcs.1991.185341 · Cited by 396
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
Secure databases: protection against user influence
Dobkin, D., Jones, A. K., & Lipton, R. J. (1979) · ACM Transactions on Database Systems · doi:10.1145/320064.320068 · Cited by 203
On hiding information from an oracle
Abadi, M., Feigenbaum, J., & Kilian, J. (1989) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(89)90018-4 · Cited by 200
Algebraic methods for interactive proof systems
Lund, C., Fortnow, L., Karloff, H., & Nisan, N. (2002) · Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science · doi:10.1109/fscs.1990.89518 · Cited by 193
Nondeterministic exponential time has two-prover interactive protocols
Babai, L., Fortnow, L., & Lund, C. (2002) · Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science · doi:10.1109/fscs.1990.89520 · Cited by 188
Security with Low Communication Overhead
Beaver, D., Feigenbaum, J., Kilian, J., & Rogaway, P. (2007) · Springer eBooks · doi:10.1007/3-540-38424-3_5 · Cited by 93
Security problems on inference control for SUM, MAX, and MIN queries
Chin, F. Y. L. (1986) · Journal of the ACM · doi:10.1145/5925.5928 · Cited by 83
A modified random perturbation method for database security
Tendick, P., & Matloff, N. (1994) · ACM Transactions on Database Systems · doi:10.1145/174638.174641 · Cited by 71
Modified bounds for covering codes
Honkala, I. S. (1991) · IEEE Transactions on Information Theory · doi:10.1109/18.75253 · Cited by 61
Simultaneous messages vs. communication
Babai, L., Kimmel, P. G., & Lokam, S. V. (1995) · Lecture notes in computer science · doi:10.1007/3-540-59042-0_88 · Cited by 39
Modified ranks of tensors and the size of circuits
Pudlák, P., & Rödl, V. (1993) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/167088.167228 · Cited by 26
Cited by
Douceur, J. R. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45748-8_24 · Cited by 4,419
“This paper shows that, without aa logically centralized authority,,Sybil attacks are always possible except under extreme andd unrealistic assumptions of resource parity andd coordinationn amongg entities.”
BackgroundPractical techniques for searches on encrypted data
Song, D. X., Wagner, D., & Perrig, A. (2002) · Proceeding 2000 IEEE Symposium on Security and Privacy. S&P 2000 · doi:10.1109/secpri.2000.848445 · Cited by 3,350
Public Key Encryption with Keyword Search
Boneh, D., Di Crescenzo, G., Ostrovsky, R., & Persiano, G. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24676-3_30 · Cited by 3,134
Evaluating 2-DNF Formulas on Ciphertexts
Boneh, D., Goh, E.-J., & Nissim, K. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30576-7_18 · Cited by 1,692
Chor, B., Kushilevitz, E., Goldreich, O., & Sudan, M. (1998) · Journal of the ACM · doi:10.1145/293347.293350 · Cited by 1,612
Self-citation
Metadata
- Authors
- Chor, B., Goldreich, O., Kushilevitz, E., & Sudan, M.
- Venue
- Proceedings of IEEE 36th Annual Foundations of Computer Science
- Publisher
- IEEE Comput. Soc. Press
- Published
- 2002-11-19
- Pages
- 41-50
- ISSN
- 0272-5428 (ISSN-L)
- OpenAlex
- W2150307013
- Cited by
- 1,116
- References
- 23
- FWCI
- 25.01
- 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
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.