CoChat
Sign Up
Cited by 249Cryptography and Data SecurityCloud Data Security SolutionsCoding theory and cryptography

Computationally private information retrieval (extended abstract)

Open access
Chor, Benny, Gilboa, Niv·1997·Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97
DOI 10.1145/258533.258609
Open this paper in CoChat — free accountOpen PDF

Abstract

Gilboat show that the computational approach leads to substantial savings.For every ~> 0, we present a two database computational PIR scheme whose communication complexity is O(n').This improved efficiency is achieved by a combination of a novel balancing technique, together with careful application of pseudo random generators.Our schemes preserve some desired properties of previous solutions.In particular, all our schemes use only one round of communication, they are fairly simple, they are memoryless, and the database contents is stored in its plain form, without any encoding.is possible to protect the user's privacy.The solutions to this private information retrieval (PIR) problem enable the user to retrieve a desired data item, while giving each individual database no partial information on the query.The quality of a solution is measured primarily ' Details on related models and techniques can also be found in [3].random generators [2, 10].(This is equivalent to the existence of one way functions [6, 5]. ) Under this assumption, we develop a family of computational PIR schemes.All these schemes

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.258609

Cites

7 of 7 references verified0 citation errors · 0 not checkable

Statistics

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

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Various applications of SMC such as the private information retrieval problem (PIR) are introduced by Chor and Gilboa.

    “Various applications of SMC such as the private information retrieval problem (PIR) [114] are introduced by Chor and Gilboa.”

    From A Survey of Self-Sovereign Identity Ecosystem (2021) · cites this paper as [114]

    The Abstract (page unavailable) presents Chor and Gilboa’s computational PIR schemes, so the paper is a valid example of work on PIR. But it credits Chor, Goldreich, Kushilevitz and Sudan with the first work introducing the PIR model; it does not identify PIR as an SMC application. (LLM, conf=0.86)

    Experimental — accuracy not yet measured

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 6

  1. M. Blum and S.. Micali, "HOW to Gen- erate Cryptogmphicaliy Strong Sequences of Pseudo Random Bits", SIAM Jour. on Computing, Vol. 13 (1984), pp. 850-864.
  2. Goldreich, "Z'owards a Theory of Soft- ware Protection and Simulation by Obliv- ious RAMs", Proc. of 19th STOC (1987), pp. 182-194.
  3. J. H&stad "Pseudo-Random gener- ators with Uniform Assumptions", Proc. of 22nd STOC (1990), pp. 395-404.
  4. R. Impagliazzo, L.A. Levin, M. Luby, "PseudoRandom Genemtion from One- Way Functions", Proc. of 29th FOCS (1989), pp. 12-24.
  5. R. Ostrovsky, V. Shoup, "Private Infor- mation Stomge", these proceedings.
  6. A. Yao, "Theory and Applications of Tmpdoor Functions", Proc. of 23'd FOCS (1982), pp. 80-91.

Cited by

Sorted by citations

Related

Authors
Chor, B., & Gilboa, N.
Affiliations
Technion – Israel Institute of Technology (IL)
ORCID
Gilboa, Niv
Venue
Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97
Publisher
ACM Press
Published
1997
Pages
304-313
DOI
10.1145/258533.258609
OpenAlex
W1983182180
Cited by
249
References
7
Citations by year
2026: 5 · 2025: 8 · 2024: 10 · 2023: 11 · 2022: 6 · 2021: 7 · 2020: 3 · 2019: 3 · 2018: 11 · 2017: 8 · 2016: 8 · 2015: 9 · 2014: 13 · 2013: 12 · 2012: 10
FWCI
6.04
Type
conference paper
Language
en
Open access
Licence
www.acm.org/publications/policies/copyright_policy#Background (vor)
Locations
ACM Symposium on Theory of Computing (STOC) (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Cryptography and Data Security
  • Physical Sciences › Computer Science › Information Systems › Cloud Data Security Solutions
  • Physical Sciences › Computer Science › Artificial Intelligence › Coding theory and cryptography
Keywords
private information retrieval, communication complexity, pseudorandom number generators, one-way functions, query privacy

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