Respire: High-Rate PIR for Databases with Small Records
Alexander Burton, Samir Jordan Menon, David J. Wu
Abstract
Private information retrieval (PIR) is a key building block in many privacy-preserving systems, and recent works have made significant progress on reducing the concrete computational costs of single-server PIR. However, existing constructions have high communication overhead, especially for databases with small records. In this work, we introduce Respire, a lattice-based PIR scheme tailored for databases of small records. To retrieve a single record from a database with over a million 256-byte records, the Respire protocol requires just 6.1 KB of online communication; this is a 5.9x reduction compared to the best previous lattice-based scheme. Moreover, Respire naturally extends to support batch queries. Compared to previous communication-efficient batch PIR schemes, Respire achieves a 3.4-7.1x reduction in total communication while maintaining comparable throughput (200-400 MB/s). The design of Respire relies on new query compression and response packing techniques based on ring switching in homomorphic encryption.
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 deff1165-9766-4a3a-bd24-5a7686382fd8Cited by top-tier papers6
- Encrypted Matrix-Vector Products from Secret Dual CodesFabrice Benhamouda, Caicai Chen, Shai Halevi, Yuval Ishai et al.CCS 2025 · 1 citation
- Do You Need a Receipt? Anonymous Credential Revocation at Continental Scale via Private Record CertificationKasra EdalatNejad, Sebastian Faust, Jonas Hofmann, Philipp-Florens Lehwalder et al.USENIX Security 2026 · 1 citation
- ZipPIR: High-throughput Single-server PIR without Client-side StorageRasoul Akhavan Mahdavi, Abdulrahman Diaa, Florian KerschbaumUSENIX Security 2026
- SPIRIT: Batch Hintless Single-Server PIR via Stateful Ciphertext ConversionZhou Zhang, Ran Mao, Zian Zhao, Haowen Pan et al.USENIX Security 2026
- UnifOMR: Oblivious Message Retrieval with Near-optimal Concrete EfficiencyBen Fisch, Zeyu Liu, Eran Tromer, Yunhao WangCCS 2026
Builds on23
- Function Secret Sharing: Improvements and ExtensionsElette Boyle, Niv Gilboa, Yuval IshaiCCS 2016 · 404 citations
- PIR with Compressed Queries and Amortized Query ProcessingSebastian Angel, Hao Chen, Kim Laine, Srinath T. V. SettyS&P 2018 · 353 citations
- Protecting accounts from credential stuffing with password breach alertingKurt Thomas, Jennifer Pullman, Kevin Yeo, Ananth Raghunathan et al.USENIX Security 2019 · 154 citations
- 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
Related papers
- VIA: Communication-Efficient Single-Server Private Information RetrievalChenyang Liu, Xukun Wang, Zhifang ZhangS&P 2026 · 2 citations
- InsPIRe: Communication-Efficient PIR with Server-Side PreprocessingRasoul Akhavan Mahdavi, Sarvar Patel, Joon Young Seo, Kevin YeoS&P 2026 · 5 citations
- Vectorized Batch Private Information RetrievalMuhammad Haris Mughees, Ling RenS&P 2023
- Two-Server Private Information Retrieval in Sublinear Time and Quasilinear SpaceAlexandra Henzinger, Seyoon RagavanEUROCRYPT 2026
- OnionPIR: Response Efficient Single-Server PIRMuhammad Haris Mughees, Hao Chen, Ling RenCCS 2021 · 1 citation
