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 accessAbstract
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.
Integrity signals
Registry
Cites
Statistics
Figures
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.
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?
The check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“Methods combining Federated Averaging with sparsification and/or quantization of model updates to a small number of bits have demonstrated significant reductions in communication cost with minimal impact on training accuracy [282].”
From Advances and Open Problems in Federated Learning (2021) · cites this paper as [282]
Experimental — accuracy not yet measuredThe check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“Much of the existing literature applies to the objective (a) [282, 440, 281, 17, 235, 55].”
From Advances and Open Problems in Federated Learning (2021) · cites this paper as [282]
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.
Citations
Cites
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
Paillier, P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48910-x_16 · Cited by 7,250 · cited 5×
“We construct a library that constructs PIR based on the Paillier cryptosystem [43] and build a PSIR scheme on top of the Paillier PIR library.”
BackgroundMethodInfluentialUntraceable electronic mail, return addresses, and digital pseudonyms
Chaum, D. L. (1981) · Communications of the ACM · doi:10.1145/358549.358563 · Cited by 4,289 · cited 1×
“That is, the adversary cannot learn the identity of the querying clients which can be enforced by requiring clients to use anonymous mix networks [16].”
BackgroundStatistical Tables for Biological, Agricultural and Medical Research.
Reed, L. J., Fisher, R. A., & Yates, F. (1944) · Journal of the American Statistical Association · doi:10.2307/2280633 · Cited by 2,998
Modular multiplication without trial division
Montgomery, P. L. (1985) · Mathematics of Computation · doi:10.1090/s0025-5718-1985-0777282-x · Cited by 2,669 · cited 1×
“In addition, we perform all modular multiplications using the Montgomery representation [40] of multiplicands described in OpenSSL.”
MethodSoftware protection and simulation on oblivious RAMs
Goldreich, O., & Ostrovsky, R. (1996) · Journal of the ACM · doi:10.1145/233551.233553 · Cited by 1,617
(Leveled) Fully Homomorphic Encryption without Bootstrapping
Brakerski, Z., Gentry, C., & Vaikuntanathan, V. (2014) · ACM Transactions on Computation Theory · doi:10.1145/2633600 · Cited by 1,430 · cited 1×
“Using leveled fully homomorphic encryption [13] and Reed-Muller codes [42, 46], Hamlin et al.”
Chor, B., Goldreich, O., Kushilevitz, E., & Sudan, M. (2002) · Proceedings of IEEE 36th Annual Foundations of Computer Science · doi:10.1109/sfcs.1995.492461 · Cited by 1,116 · cited 1×
“Private Information Retrieval (PIR) [18, 36] is a very important privacy-preserving primitive for accessing data held by untrusted servers.”
BackgroundFully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
Brakerski, Z., & Vaikuntanathan, V. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-22792-9_29 · Cited by 1,096
Damgård, I., & Jurik, M. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44586-2_9 · Cited by 1,063
Research works printed but not linked: 14
- 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.
- 10.5555/646765.704119 · doi:10.5555/646765.704119
- Brakerski Zvika, Annual cryptology conference
- 10.5555/795662.796270 · doi:10.5555/795662.796270
- 10.5555/648118.746742 · doi:10.5555/648118.746742
- Ronald, 1948, Fisher and Frank Yates
- Gupta Trinabh, 2016, Lorenzo Alvisi, and Michael Walfish.
- Kadhe Swanand, 2017, Salim El Rouayheb, and Alex Sprintson
- Katz Jonathan, 1996, Paul C Van Oorschot, and Scott A Vanstone
- 10.5555/795663.796363 · doi:10.5555/795663.796363
- 10.5555/1756123.1756146 · doi:10.5555/1756123.1756146
- Mihai, Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms. Society for Industrial and Applied Mathematics, 20--29
- Ristenpart Thomas, 2013, Proceedings, Part I, Ran Canetti and Juan A. Garay (Eds.). 392--409
- Straus Ernst G., 1964, Addition chains of vectors (problem 5125), American Mathematical Monthly, 70, 806
Cited by
Advances and Open Problems in Federated Learning
Kairouz, P., & McMahan, H. B. (2021) · Foundations and Trends in Machine Learning · doi:10.1561/2200000083 · Cited by 7,772
“[319] shows how the latter side information can be obtained and a practical hybrid (computational and information theoretic) PIR scheme on a single server was implemented and validated.”
BackgroundPrivacy-preserving cloud computing on sensitive data: A survey of methods, products and challenges
Domingo-Ferrer, J., Farràs, O., Ribes-González, J., & Sánchez, D. (2019) · Computer Communications · doi:10.1016/j.comcom.2019.04.011 · Cited by 202
Private Information Retrieval With Side Information
Kadhe, S., Garcia, B., Heidarzadeh, A., Rouayheb, S. E., & Sprintson, A. (2019) · IEEE Transactions on Information Theory · doi:10.1109/tit.2019.2948845 · Cited by 146
“The work of [34] builds up on the Partition and Code scheme to design a computationally efficient single-server PIR scheme with computational privacy guarantees.”
MethodSPIRAL: Fast, High-Rate Single-Server PIR via FHE Composition
Menon, S. J., & Wu, D. J. (2022) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp46214.2022.9833700 · Cited by 127
Billion-scale federated learning on mobile clients: a submodel design with tunable privacy
Niu, C., Wu, F., Tang, S., Hua, L., Jia, R., Lv, C., Wu, Z., & Chen, G. (2020) · ACM Annual International Conference on Mobile Computing and Networking (MobiCom) · doi:10.1145/3372224.3419188 · Cited by 161
“To avoid downloading the full matrix, private information retrieval (PIR) [4, 12, 44] can be applied, which exactly matches the problem settings, including the read-only mode and the concealment of the retrieved elements.”
Method
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
- hybrid
- doi.org
- Licence
- 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.
