Simple and Practical Amortized Sublinear Private Information Retrieval using Dummy Subsets
Pages 1420 - 1433
Abstract
Recent works in amortized sublinear Private Information Retrieval (PIR) have demonstrated great potential. Despite the inspiring progress, existing schemes in this new paradigm are still faced with various challenges and bottlenecks, including large client storage, high communication, poor practical efficiency, need for non-colluding servers, or restricted client query sequences. We present simple and practical amortized sublinear stateful private information retrieval schemes without these drawbacks using new techniques in hint construction and usage. In particular, we introduce a dummy set to the client's request to eliminate any leakage or correctness failures. Our techniques can work with two non-colluding servers or a single server. The resulting PIR schemes achieve practical efficiency. The online response overhead is only twice that of simply fetching the desired entry without privacy. For a database with 2^28 entries of 32-byte, each query of our two-server scheme consumes 34 KB of communication and 2.7 milliseconds of computation, and each query of our single-server scheme consumes amortized 47 KB of communication and 4.5 milliseconds of computation. These results are one or more orders of magnitude better than prior works.
References
[1]
Asra Ali, Tancrède Lepoint, Sarvar Patel, Mariana Raykova, Phillipp Schoppmann, Karn Seth, and Kevin Yeo. 2021. Communication--Computation Trade-offs in PIR. In 30th USENIX Security Symposium. 1811--1828.
[2]
Sebastian Angel, Hao Chen, Kim Laine, and Srinath Setty. 2018. PIR with compressed queries and amortized query processing. In 2018 IEEE symposium on security and privacy (SP). IEEE, 962--979.
[3]
Amos Beimel, Yuval Ishai, and Tal Malkin. 2000. Reducing the servers computation in private information retrieval: PIR with preprocessing. In 20th Annual International Cryptology Conference (CRYPTO). Springer, 55--73.
[4]
Elette Boyle, Niv Gilboa, and Yuval Ishai. 2016. Function secret sharing: Improvements and extensions. In Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security. 1292--1303.
[5]
Elette Boyle, Yuval Ishai, Rafael Pass, and Mary Wootters. 2017. Can we access a database both locally and privately?. In Theory of Cryptography: 15th International Conference. Springer, 662--693.
[6]
Christian Cachin, Silvio Micali, and Markus Stadler. 1999. Computationally private information retrieval with polylogarithmic communication. In International Conference on the Theory and Application of Cryptographic Techniques (EUROCRYPT). Springer, 402--414.
[7]
Ran Canetti, Justin Holmgren, and Silas Richelson. 2017. Towards doubly efficient private information retrieval. In Theory of Cryptography: 15th International Conference. Springer, 694--726.
[8]
Benny Chor, Eyal Kushilevitz, Oded Goldreich, and Madhu Sudan. 1998. Private information retrieval. Journal of the ACM (JACM), Vol. 45, 6 (1998), 965--981.
[9]
Henry Corrigan-Gibbs, Alexandra Henzinger, and Dmitry Kogan. 2022. Single-server private information retrieval with sublinear amortized time. In Annual International Conference on the Theory and Applications of Cryptographic Techniques. Springer, 3--33.
[10]
Henry Corrigan-Gibbs and Dmitry Kogan. 2020. Private information retrieval with sublinear online time. In Annual International Conference on the Theory and Applications of Cryptographic Techniques. Springer, 44--75.
[11]
Ivan Damgård and Mads Jurik. 2001. A generalisation, a simplification and some applications of Paillier's probabilistic public-key system. In 4th International Workshop on Practice and Theory in Public Key Cryptosystems (PKC). Springer, 119--136.
[12]
Alex Davidson, Gonccalo Pestana, and Sofía Celi. 2023. Frodopir: Simple, scalable, single-server private information retrieval. Proceedings on Privacy Enhancing Technologies (2023).
[13]
Zeev Dvir and Sivakanth Gopi. 2016. 2-server PIR with subpolynomial communication. Journal of the ACM (JACM), Vol. 63, 4 (2016), 1--15.
[14]
Craig Gentry and Zulfikar Ramzan. 2005. Single-database private information retrieval with constant communication rate. In International Colloquium on Automata, Languages, and Programming. Springer, 803--815.
[15]
Niv Gilboa and Yuval Ishai. 2014. Distributed point functions and their applications. In 33rd Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT). Springer, 640--658.
[16]
Trinabh Gupta, Natacha Crooks, Whitney Mulhern, Srinath Setty, Lorenzo Alvisi, and Michael Walfish. 2016. Scalable and private media consumption with Popcorn. In 13th USENIX Symposium on Networked Systems Design and Implementation (NSDI 16). 91--107.
[17]
Alexandra Henzinger, Matthew M Hong, Henry Corrigan-Gibbs, Sarah Meiklejohn, and Vinod Vaikuntanathan. 2023. One Server for the Price of Two: Simple and Fast Single-Server Private Information Retrieval. In 32nd USENIX Security Symposium (USENIX Security 23). 3889--3905.
[18]
Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, and Amit Sahai. 2004. Batch codes and their applications. In Proceedings of the thirty-sixth annual ACM symposium on Theory of computing. 262--271.
[19]
Dmitry Kogan and Henry Corrigan-Gibbs. 2021. Private blocklist lookups with checklist. In 30th USENIX security symposium (USENIX Security 21). 875--892.
[20]
Eyal Kushilevitz and Rafail Ostrovsky. 1997. Replication is not needed: Single database, computationally-private information retrieval. In Proceedings 38th annual symposium on foundations of computer science. IEEE, 364--373.
[21]
Arthur Lazzaretti and Charalampos Papamanthou. 2023. Near-optimal private information retrieval with preprocessing. In Theory of Cryptography Conference. Springer, 406--435.
[22]
Arthur Lazzaretti and Charalampos Papamanthou. 2023. Treepir: Sublinear-time and polylog-bandwidth private information retrieval from ddh. In Annual International Cryptology Conference. Springer, 284--314.
[23]
Wei-Kai Lin, Ethan Mook, and Daniel Wichs. 2023. Doubly efficient private information retrieval and fully homomorphic RAM computation from ring LWE. In Proceedings of the 55th Annual ACM Symposium on Theory of Computing. 595--608.
[24]
Yiping Ma, Ke Zhong, Tal Rabin, and Sebastian Angel. 2022. Incremental Offline/Online PIR. In 31st USENIX Security Symposium. 1741--1758.
[25]
Carlos Aguilar Melchor, Joris Barrier, Laurent Fousse, and Marc-Olivier Killijian. 2016. XPIR: Private information retrieval for everyone. Proceedings on Privacy Enhancing Technologies (2016), 155--174.
[26]
Samir Jordan Menon and David J Wu. 2022. Spiral: Fast, high-rate single-server PIR via FHE composition. In 2022 IEEE Symposium on Security and Privacy (SP). IEEE, 930--947.
[27]
Prateek Mittal, Femi Olumofin, Carmela Troncoso, Nikita Borisov, and Ian Goldberg. 2011. PIR-Tor: Scalable Anonymous Communication Using Private Information Retrieval. In 20th USENIX security symposium.
[28]
Muhammad Haris Mughees, Hao Chen, and Ling Ren. 2021. OnionPIR: Response efficient single-server PIR. In Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security. 2292--2306.
[29]
Muhammad Haris Mughees and Ling Ren. 2023. Vectorized batch private information retrieval. In 2023 IEEE Symposium on Security and Privacy (SP). IEEE, 437--452.
[30]
David R. Musser. 1997. Introspective Sorting and Selection Algorithms., 983--993 pages.
[31]
Sarvar Patel, Giuseppe Persiano, and Kevin Yeo. 2018. Private stateful information retrieval. In Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security. 1002--1019.
[32]
Elaine Shi, Waqar Aqeel, Balakrishnan Chandrasekaran, and Bruce Maggs. 2021. Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time. In 41st Annual International Cryptology Conference (CRYPTO). Springer, 641--669.
[33]
Mingxun Zhou, Wei-Kai Lin, Yiannis Tselekounis, and Elaine Shi. 2023. Optimal single-server private information retrieval. In Annual International Conference on the Theory and Applications of Cryptographic Techniques. Springer, 395--425.
[34]
Mingxun Zhou, Andrew Park, Wenting Zheng, and Elaine Shi. 2023. PIANO: Extremely Simple, Single-Server PIR with Sublinear Server Computation. In 2024 IEEE Symposium on Security and Privacy (SP). IEEE Computer Society, 55--55.
Index Terms
- Simple and Practical Amortized Sublinear Private Information Retrieval using Dummy Subsets
Recommendations
Single-Server Private Information Retrieval with Sublinear Amortized Time
Advances in Cryptology – EUROCRYPT 2022AbstractWe construct new private-information-retrieval protocols in the single-server setting. Our schemes allow a client to privately fetch a sequence of database records from a server, while the server answers each query in average time sublinear in the ...
Robust Information-Theoretic Private Information Retrieval
An information-theoretic private information retrieval (PIR) protocol allows a user to retrieve a data item of its choice from a database replicated amongst several servers, such that each server gains absolutely no information on the identity of the ...
General constructions for information-theoretic private information retrieval
A Private Information Retrieval (PIR) protocol enables a user to retrieve a data item from a database while hiding the identity of the item being retrieved; specifically, in a t-private k-server PIR protocol the database is replicated among k servers, ...
Comments
Information & Contributors
Information
Published In
December 2024
5188 pages
ISBN:9798400706363
DOI:10.1145/3658644
- General Chairs:
- Bo Luo,
- Xiaojing Liao,
- Jun Xu,
- Program Chairs:
- Engin Kirda,
- David Lie
Copyright © 2024 Owner/Author.
This work is licensed under a Creative Commons Attribution International 4.0 License.
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 09 December 2024
Check for updates
Badges
Qualifiers
- Research-article
Funding Sources
Conference
CCS '24
Sponsor:
CCS '24: ACM SIGSAC Conference on Computer and Communications Security
October 14 - 18, 2024
UT, Salt Lake City, USA
Acceptance Rates
Overall Acceptance Rate 1,261 of 6,999 submissions, 18%
Upcoming Conference
CCS '25
- Sponsor:
- sigsac
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 143Total Downloads
- Downloads (Last 12 months)143
- Downloads (Last 6 weeks)90
Reflects downloads up to 24 Jan 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in