Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 225

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

Private information storage (extended abstract)

Ostrovsky, Rafail, Shoup, Victor·1997·Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97

Abstract

) Rafail Ostrovsky Victor Shoup y Bellcore Bellcore, IBM May 1997 Abstract This paper deals with the problem of efficiently and privately storing and retrieving information that is distributively maintained in several databases that do not communicate with one another. The goal is to minimize the communication complexity while maintaining privacy (i.e., so that individual databases do not get any information about the data or the nature of the users' queries). The question of private retrieval from multiple databases was introduced in a very nice paper of Chor, Goldreich, Kushilevitz and Sudan (FOCS '95), but the question whether it is possible to perform both reading and writing in a communication-efficient manner remained open. In this paper, we answer this question in the affirmative, and show that efficient read/write schemes are indeed possible. In fact, we show a general informationtheoretic reduction from reading and writing to any read-only scheme that preserves the comm...

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.1145/258533.258606

Cites

2 of 2 references verified0 citation errors · 0 not checkable

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

Cites

Show all 2 references

Cited by

See all 225

Metadata

Authors
Ostrovsky, R., & Shoup, V.
Venue
Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97
Publisher
ACM Press
Published
1997
Pages
294-303
OpenAlex
W2019356824
Cited by
225
References
2
FWCI
3.83
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 storage (extended abstract). https://app.cochat.ai/papers/10.1145/258533.258606
The paper
Ostrovsky, R., & Shoup, V. (1997). Private information storage (extended abstract). Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97. https://doi.org/10.1145/258533.258606

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.