Protecting Data Privacy in Private Information Retrieval Schemes
Open accessThe DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
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
Shamir, A. (1979) · Communications of the ACM · doi:10.1145/359168.359176 · Cited by 13,756
How to construct random functions
Goldreich, O., Goldwasser, S., & Micali, S. (1986) · Journal of the ACM · doi:10.1145/6490.6503 · Cited by 2,115
A Randomized Protocol for Signing Contracts
Even, S., Goldreich, O., & Lempel, A. (1983) · Advances in Cryptology · doi:10.1007/978-1-4757-0602-4_19 · Cited by 1,450
How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
Blum, M., & Micali, S. (1984) · SIAM Journal on Computing · doi:10.1137/0213053 · Cited by 1,322
Non-interactive zero-knowledge and its applications
Blum, M., Feldman, P., & Micali, S. (1988) · Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88 · doi:10.1145/62212.62222 · Cited by 904
The Complexity of Boolean Functions
(2005) · Complexity Theory · doi:10.1007/3-540-27477-4_16 · Cited by 376
A Zero-One Law for Boolean Privacy
Chor, B., & Kushilevitz, E. (1991) · SIAM Journal on Discrete Mathematics · doi:10.1137/0404004 · Cited by 147
Self-citationPrivacy and Communication Complexity
Kushelvitz, E. (1992) · SIAM Journal on Discrete Mathematics · doi:10.1137/0405021 · Cited by 133
Oblivious transfers and intersecting codes
Brassard, G., Crépeau, C., & Sántha, M. (1996) · IEEE Transactions on Information Theory · doi:10.1109/18.556673 · Cited by 108
Cited by
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
A Survey on Federated Learning for Resource-Constrained IoT Devices
Imteaj, A., Thakker, U., Wang, S., Li, J., & Amini, M. H. (2022) · IEEE Internet of Things Journal · doi:10.1109/jiot.2021.3095077 · Cited by 774
Blind Seer: A Scalable Private DBMS
Pappas, V., Krell, F., Vo, B., Kolesnikov, V., Malkin, T., Choi, S. G., George, W., Keromytis, A., & Bellovin, S. (2014) · 2014 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2014.30 · Cited by 237
Self-citationExperimental quantum private queries with linear optics
De Martini, F., Giovannetti, V., Lloyd, S., Maccone, L., Nagali, E., Sansoni, L., & Sciarrino, F. (2009) · Physical Review A · doi:10.1103/physreva.80.010302 · Cited by 81
Metadata
- Authors
- Gertner, Y., Ishai, Y., Kushilevitz, E., & Malkin, T.
- Venue
- Journal of Computer and System Sciences
- Publisher
- Elsevier BV
- Published
- 2000-06
- Volume
- 60
- Issue
- 3
- Pages
- 592-629
- ISSN
- 0022-0000 (ISSN-L)
- OpenAlex
- W2951483008
- Cited by
- 214
- References
- 9
- FWCI
- 1.25
- Type
- journal article
- Language
- en
- Open access
- bronze
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: Protecting Data Privacy in Private Information Retrieval Schemes. https://app.cochat.ai/papers/10.1006/jcss.1999.1689
- The paper
- Gertner, Y., Ishai, Y., Kushilevitz, E., & Malkin, T. (2000). Protecting Data Privacy in Private Information Retrieval Schemes. Journal of Computer and System Sciences. https://doi.org/10.1006/jcss.1999.1689
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.