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

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

Private Stateful Information Retrieval

Open access
Patel, Sarvar, Persiano, Giuseppe, Yeo, Kevin · 2018 · Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security

Abstract

Private information retrieval (PIR) is a fundamental tool for preserving query privacy when accessing outsourced data. All previous PIR constructions have significant costs preventing widespread use. In this work, we present private stateful information retrieval (PSIR), an extension of PIR, allowing clients to be stateful and maintain information between multiple queries. Our design of the PSIR primitive maintains three important properties of PIR: multiple clients may simultaneously query without complex concurrency primitives, query privacy should be maintained if the server colludes with other clients, and new clients should be able to enroll into the system by exclusively interacting with the server. We present a PSIR framework that reduces an online query to performing one single-server PIR on a sub-linear number of database records. All other operations beyond the single-server PIR consist of cryptographic hashes or plaintext operations. In practice, the dominating costs of resources occur due to the public-key operations involved with PIR. By reducing the input database to PIR, we are able to limit expensive computation and avoid transmitting large ciphertexts. We show that various instantiations of PSIR reduce server CPU by up to 10x and online network costs by up to 10x over the previous best PIR construction.

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

Cites

42 of 42 references verified0 citation errors · 0 not checkable

Statistics

Figures

Figure 3 The amortized latency for queries under different settings.
Figure 3 The amortized latency for queries under different settings.CC-BY-NC-SA · From the PDF

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

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?

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 43 references

Research works printed but not linked: 14

  1. Sebastian Angel and Srinath TV Setty. 2016. Unobservable Communication over Fully Untrusted Infrastructure.. In OSDI. 551--569. Sebastian Angel and Srinath TV Setty. 2016. Unobservable Communication over Fully Untrusted Infrastructure.. In OSDI. 551--569.
  2. 10.5555/646765.704119 · doi:10.5555/646765.704119
  3. Brakerski Zvika, Annual cryptology conference
  4. 10.5555/795662.796270 · doi:10.5555/795662.796270
  5. 10.5555/648118.746742 · doi:10.5555/648118.746742
  6. Ronald, 1948, Fisher and Frank Yates
  7. Gupta Trinabh, 2016, Lorenzo Alvisi, and Michael Walfish.
  8. Kadhe Swanand, 2017, Salim El Rouayheb, and Alex Sprintson
  9. Katz Jonathan, 1996, Paul C Van Oorschot, and Scott A Vanstone
  10. 10.5555/795663.796363 · doi:10.5555/795663.796363
  11. 10.5555/1756123.1756146 · doi:10.5555/1756123.1756146
  12. Mihai, Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms. Society for Industrial and Applied Mathematics, 20--29
  13. Ristenpart Thomas, 2013, Proceedings, Part I, Ran Canetti and Juan A. Garay (Eds.). 392--409
  14. Straus Ernst G., 1964, Addition chains of vectors (problem 5125), American Mathematical Monthly, 70, 806

Cited by

See all 64

Metadata

Authors
Patel, S., Persiano, G., & Yeo, K.
Affiliations
Google (United States) (US)
Venue
Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security
Publisher
ACM
Published
2018-10-15
Pages
1002-1019
ISSN
1543-7221 (ISSN-L)
OpenAlex
W2889812870
Cited by
61
References
43
Citations by year
2026: 8 · 2025: 9 · 2024: 11 · 2023: 8 · 2022: 3 · 2021: 8 · 2020: 8 · 2019: 6
FWCI
2.24
Type
conference paper
Language
en
Open access
Locations
ACM SIGSAC Conference on Computer and Communications Security (CCS) (publishedVersion, cc-by-nc-sa)
Topics
  • Physical Sciences › Computer Science › Computer Networks and Communications › Cryptography and Data Security
  • Physical Sciences › Computer Science › Information Systems › Cloud Data Security Solutions
  • Physical Sciences › Computer Science › Artificial Intelligence › Internet Traffic Analysis and Secure E-voting
Keywords
private information retrieval, query privacy, outsourced data, public-key cryptography, computational efficiency, network cost reduction

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 Stateful Information Retrieval. https://app.cochat.ai/papers/10.1145/3243734.3243821
The paper
Patel, S., Persiano, G., & Yeo, K. (2018). Private Stateful Information Retrieval. Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security. https://doi.org/10.1145/3243734.3243821

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.