Secret-Key PIR from Random Linear Codes
Caicai Chen, Yuval Ishai, Tamer Mour, Alon Rosen
2026年份
6被引次数
1顶会引用
摘要
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.
问问这篇 Paper
问问你的智能体。
Lune 读过与它相关的顶会 Paper,每个回答都会注明依据哪几篇。
引用它的顶会 Paper1
问问它们各自怎么用它相关 Paper
- ThorPIR: Single Server PIR via Homomorphic Thorp ShufflesBen Fisch, Arthur Lazzaretti, Zeyu Liu, Charalampos PapamanthouCCS 2024 · 被引用 9 次
- 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 次
- Piano: Extremely Simple, Single-Server PIR with Sublinear Server ComputationMingxun Zhou, Andrew Park, Wenting Zheng, Elaine ShiS&P 2024 · 被引用 69 次
- Optimal Single-Server Private Information RetrievalMingxun Zhou, Wei-Kai Lin, Yiannis Tselekounis, Elaine ShiEUROCRYPT 2023 · 被引用 28 次
