Secret-Key PIR from Random Linear Codes
Caicai Chen, Yuval Ishai, Tamer Mour, Alon Rosen
2026Year
6Citations
1Top-tier citations
Abstract
Private information retrieval (PIR) allows to privately read a chosen bit from an N-bit database x with o(N) bits of communication. Lin, Mook, and Wichs (STOC 2023) showed that by preprocessing x into an encoded database x, it suffices to access only polylog(N) bits of x per query. This requires |x|≥ N· polylog(N), and even larger server circuit size.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get 21604f95-68f4-4edb-a08d-a526e4535419Cited by top-tier papers1
Ask how each one uses itRelated papers
- ThorPIR: Single Server PIR via Homomorphic Thorp ShufflesBen Fisch, Arthur Lazzaretti, Zeyu Liu, Charalampos PapamanthouCCS 2024 · 9 citations
- Two-Server Private Information Retrieval in Sublinear Time and Quasilinear SpaceAlexandra Henzinger, Seyoon RagavanEUROCRYPT 2026
- Lower Bounds for (Batch) PIR with Private PreprocessingKevin YeoEUROCRYPT 2023 · 15 citations
- Piano: Extremely Simple, Single-Server PIR with Sublinear Server ComputationMingxun Zhou, Andrew Park, Wenting Zheng, Elaine ShiS&P 2024 · 69 citations
- Optimal Single-Server Private Information RetrievalMingxun Zhou, Wei-Kai Lin, Yiannis Tselekounis, Elaine ShiEUROCRYPT 2023 · 28 citations
