Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Sign Up
Cited by 1,116

The DOI matches its Crossref record.

Private information retrieval

Chor, B., Goldreich, O., Kushilevitz, E., Sudan, M.·2002·Proceedings of IEEE 36th Annual Foundations of Computer Science
DOI 10.1109/sfcs.1995.492461
Open this paper in CoChat — free account

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.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/sfcs.1995.492461

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.

A few free checks a day · papers already verified open instantly · results are public

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

See all 1,116

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)
DOI
10.1109/sfcs.1995.492461
OpenAlex
W2150307013
Cited by
1,116
References
0
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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Private information retrieval. https://app.cochat.ai/papers/10.1109/sfcs.1995.492461
The paper
Chor, B., Goldreich, O., Kushilevitz, E., & Sudan, M. (2002). Private information retrieval. Proceedings of IEEE 36th Annual Foundations of Computer Science. https://doi.org/10.1109/sfcs.1995.492461

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.