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

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

Replication is not needed: single database, computationally-private information retrieval

Kushilevitz, E., Ostrovsky, R. · 2002 · Proceedings 38th Annual Symposium on Foundations of Computer Science

Abstract

We establish the following, quite unexpected, result: replication of data for the computational private information retrieval problem is not necessary. More specifically, based on the quadratic residuosity assumption, we present a single database, computationally private information retrieval scheme with O(n/sup /spl epsiv//) communication complexity for any /spl epsiv/>0.

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.

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

Integrity signals

Registry

Crossref · 10.1109/sfcs.1997.646125

Cites

20 of 20 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.

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.

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

Research works printed but not linked: 6

  1. bach, 1996, Algorithmic Number Theory, 1
  2. 10.1109/SFCS.1986.33 · doi:10.1109/sfcs.1986.33
  3. 10.1145/3812.3818 · doi:10.1145/3812.3818
  4. 0, STOC '85, 291
  5. odlyzko, 1995, The future of Integer Factorization, Crypto- Bytes, 1, 5
  6. ostrovsky, 1992, Software protection and simulation on oblivious RAMs

Cited by

See all 932

Metadata

Authors
Kushilevitz, E., & Ostrovsky, R.
Venue
Proceedings 38th Annual Symposium on Foundations of Computer Science
Published
2002-11-22
Pages
364-373
ISSN
0272-5428 (ISSN-L)
OpenAlex
W2154654620
Cited by
932
References
20
FWCI
17.40
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.