Private Stateful Information Retrieval
Sarvar Patel, Giuseppe Persiano, Kevin Yeo
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.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext e4ada50a-fe7d-49c5-9ddd-322179eac353Cited by top-tier papers17
- SPIRAL: Fast, High-Rate Single-Server PIR via FHE CompositionSamir Jordan Menon, David J. WuS&P 2022 · 153 citations
- Communication-Computation Trade-offs in PIRAsra Ali, Tancrède Lepoint, Sarvar Patel, Mariana Raykova et al.USENIX Security 2021 · 126 citations
- Billion-scale federated learning on mobile clients: a submodel design with tunable privacyChaoyue Niu, Fan Wu, Shaojie Tang, Lifeng Hua et al.MobiCom 2020 · 114 citations
- Private Blocklist Lookups with ChecklistDmitry Kogan, Henry Corrigan-GibbsUSENIX Security 2021 · 104 citations
- Single-Server Private Information Retrieval with Sublinear Amortized TimeHenry Corrigan-Gibbs, Alexandra Henzinger, Dmitry KoganEUROCRYPT 2022 · 64 citations
Builds on2
Related papers
- Simple and Practical Amortized Sublinear Private Information Retrieval using Dummy SubsetsLing Ren, Muhammad Haris Mughees, I SunCCS 2024 · 5 citations
- ThorPIR: Single Server PIR via Homomorphic Thorp ShufflesBen Fisch, Arthur Lazzaretti, Zeyu Liu, Charalampos PapamanthouCCS 2024 · 9 citations
- Piano: Extremely Simple, Single-Server PIR with Sublinear Server ComputationMingxun Zhou, Andrew Park, Wenting Zheng, Elaine ShiS&P 2024 · 69 citations
- Don't be Dense: Efficient Keyword PIR for Sparse DatabasesSarvar Patel, Joon Young Seo, Kevin YeoUSENIX Security 2023
- Puncturable Pseudorandom Sets and Private Information Retrieval with Near-Optimal Online Bandwidth and TimeElaine Shi, Waqar Aqeel, Balakrishnan Chandrasekaran, Bruce M. MaggsCRYPTO 2021 · 38 citations
