Cited By
View all- Luo MWang M(2025)Faster Spiral: Low-Communication, High-Rate Private Information RetrievalCryptography10.3390/cryptography90100139:1(13)Online publication date: 21-Feb-2025
Call Me By My Name: Simple, Practical Private Information Retrieval for Keyword Queries
Authors: 
Sofia Celi, Alex DavidsonAuthors Info & Claims
Sofia Celi, Alex DavidsonAuthors Info & ClaimsPages 4107 - 4121
Abstract
We introduce ChalametPIR: a single-server Private Information Retrieval (PIR) scheme supporting fast, low-bandwidth keyword queries, with a conceptually very simple design. In particular, we develop a generic framework for converting PIR schemes for index queries over flat arrays (based on the Learning With Errors problem) into keyword PIR. This involves representing a key-value map using any probabilistic filter that permits reconstruction of elements from inclusion queries (e.g. Cuckoo filters). In particular, we make use of recently developed Binary Fuse filters to construct ChalametPIR, with minimal efficiency blow-up compared with state-of-the-art index-based schemes (all costs bounded by a factor of (≤ 1.08)). Furthermore, we show that ChalametPIR achieves runtimes and financial costs that are factors of between (6x)-(11x) and (3.75x)-(11.4x) more efficient, respectively, than state-of-the-art keyword PIR approaches, for varying database configurations. Bandwidth costs are additionally reduced or remain competitive, depending on the configuration. Finally, we believe that our application of Binary Fuse filters can have independent value towards developing efficient variants of related cryptographic primitives (e.g. private set intersection), that already benefit from using less efficient filter constructions.
References
[1]
Martin R. Albrecht, Rachel Player, and Sam Scott. 2015. On the concrete hardness of Learning with Errors. J. Math. Cryptol., Vol. 9, 3 (2015), 169--203. http://www.degruyter.com/view/j/jmc.2015.9.issue-3/jmc-2015-0016/jmc-2015-0016.xml
[2]
Asra Ali, Tancrède Lepoint, Sarvar Patel, Mariana Raykova, Phillipp Schoppmann, Karn Seth, and Kevin Yeo. 2021. Communication-Computation Trade-offs in PIR, See citeNUSENIX21, 1811--1828.
[3]
Stephen Alstrup, Gerth Brodal, and Theis Rauhe. 2001. Optimal Static Range Reporting in One Dimension. In Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing (Hersonissos, Greece) (STOC '01). Association for Computing Machinery, New York, NY, USA, 476--482. https://doi.org/10.1145/380752.380842
[4]
Sebastian Angel, Hao Chen, Kim Laine, and Srinath T. V. Setty. 2018. PIR with Compressed Queries and Amortized Query Processing. In 2018 IEEE Symposium on Security and Privacy. IEEE Computer Society Press, 962--979. https://doi.org/10.1109/SP.2018.00062
[5]
AWS. [n.,d.]. Amazon EC2 On-Demand Pricing. https://aws.amazon.com/ec2/pricing/on-demand/ https://aws.amazon.com/ec2/pricing/on-demand/. Accessed 18th January 2024.
[6]
Michael Bailey and Rachel Greenstadt (Eds.). 2021. USENIX Security 2021. USENIX Association.
[7]
Burton H. Bloom. 1970. Space/Time Trade-offs in Hash Coding with Allowable Errors. Commun. ACM, Vol. 13, 7 (1970), 422--426. https://doi.org/10.1145/362686.362692
[8]
Flavio Bonomi, Michael Mitzenmacher, Rina Panigrahy, Sushil Singh, and George Varghese. 2006. An Improved Construction for Counting Bloom Filters. In Algorithms - ESA 2006, 14th Annual European Symposium, Zurich, Switzerland, September 11--13, 2006, Proceedings (Lecture Notes in Computer Science, Vol. 4168), Yossi Azar and Thomas Erlebach (Eds.). Springer, 684--695. https://doi.org/10.1007/11841036_61
[9]
Andrei Broder and Michael Mitzenmacher. 2003. Network Applications of Bloom Filters: A Survey. Internet Mathematics, Vol. 1, 4 (2003), 485 -- 509.
[10]
Sofía Celi and Alex Davidson. 2024. Call Me By My Name: Simple, Practical Private Information Retrieval for Keyword Queries. Cryptology ePrint Archive, Paper 2024/092. https://eprint.iacr.org/2024/092 https://eprint.iacr.org/2024/092.
[11]
Benny Chor, Niv Gilboa, and Moni Naor. 1998. Private Information Retrieval by Keywords. Cryptology ePrint Archive, Report 1998/003. https://eprint.iacr.org/1998/003.
[12]
Benny Chor, Oded Goldreich, Eyal Kushilevitz, and Madhu Sudan. 1995. Private Information Retrieval. In 36th FOCS. IEEE Computer Society Press, 41--50. https://doi.org/10.1109/SFCS.1995.492461
[13]
Simone Colombo, Kirill Nikitin, Henry Corrigan-Gibbs, David J. Wu, and Bryan Ford. 2023. Authenticated private information retrieval. In 32nd USENIX Security Symposium (USENIX Security 23). USENIX Association, Anaheim, CA, 3835--3851. https://www.usenix.org/conference/usenixsecurity23/presentation/colombo
[14]
Don Coppersmith and Shmuel Winograd. 1990. Matrix Multiplication via Arithmetic Progressions. J. Symb. Comput., Vol. 9, 3 (mar 1990), 251--280. https://doi.org/10.1016/S0747--7171(08)80013--2
[15]
Henry Corrigan-Gibbs, Alexandra Henzinger, and Dmitry Kogan. 2022. Single-Server Private Information Retrieval with Sublinear Amortized Time. In EUROCRYPT 2022, Part II (LNCS, Vol. 13276), Orr Dunkelman and Stefan Dziembowski (Eds.). Springer, Heidelberg, 3--33. https://doi.org/10.1007/978--3-031-07085--3_1
[16]
Henry Corrigan-Gibbs and Dmitry Kogan. 2020. Private Information Retrieval with Sublinear Online Time. In EUROCRYPT 2020, Part I (LNCS, Vol. 12105), Anne Canteaut and Yuval Ishai (Eds.). Springer, Heidelberg, 44--75. https://doi.org/10.1007/978--3-030--45721--1_3
[17]
Alex Davidson and Carlos Cid. 2017. An Efficient Toolkit for Computing Private Set Operations. In ACISP 17, Part II (LNCS, Vol. 10343), Josef Pieprzyk and Suriadi Suriadi (Eds.). Springer, Heidelberg, 261--278.
[18]
Alex Davidson, Gonc calo Pestana, and Sofía Celi. 2023. FrodoPIR: Simple, Scalable, Single-Server Private Information Retrieval. PoPETs, Vol. 2023, 1 (Jan. 2023), 365--383. https://doi.org/10.56553/popets-2023-0022
[19]
Fan Deng and Davood Rafiei. 2006. Approximately detecting duplicates for streaming data using stable bloom filters. In Proceedings of the ACM SIGMOD International Conference on Management of Data, Chicago, Illinois, USA, June 27--29, 2006, Surajit Chaudhuri, Vagelis Hristidis, and Neoklis Polyzotis (Eds.). ACM, 25--36. https://doi.org/10.1145/1142473.1142477
[20]
Peter C. Dillinger and Stefan Walzer. 2021. Ribbon filter: practically smaller than Bloom and Xor. CoRR, Vol. abs/2103.02515 (2021). showeprint[arXiv]2103.02515 https://arxiv.org/abs/2103.02515
[21]
Changyu Dong, Liqun Chen, and Zikai Wen. 2013. When private set intersection meets big data: an efficient and scalable protocol. In ACM CCS 2013, Ahmad-Reza Sadeghi, Virgil D. Gligor, and Moti Yung (Eds.). ACM Press, 789--800. https://doi.org/10.1145/2508859.2516701
[22]
Bin Fan, Dave G. Andersen, Michael Kaminsky, and Michael D. Mitzenmacher. 2014. Cuckoo Filter: Practically Better Than Bloom. In Proceedings of the 10th ACM International on Conference on Emerging Networking Experiments and Technologies (Sydney, Australia) (CoNEXT '14). Association for Computing Machinery, New York, NY, USA, 75--88. https://doi.org/10.1145/2674005.2674994
[23]
Michael J. Freedman, Yuval Ishai, Benny Pinkas, and Omer Reingold. 2005. Keyword Search and Oblivious Pseudorandom Functions. In TCC 2005 (LNCS, Vol. 3378), Joe Kilian (Ed.). Springer, Heidelberg, 303--324. https://doi.org/10.1007/978--3--540--30576--7_17
[24]
Niv Gilboa and Yuval Ishai. 2014. Distributed Point Functions and Their Applications. In EUROCRYPT 2014 (LNCS, Vol. 8441), Phong Q. Nguyen and Elisabeth Oswald (Eds.). Springer, Heidelberg, 640--658. https://doi.org/10.1007/978--3--642--55220--5_35
[25]
Thomas Mueller Graf and Daniel Lemire. 2020. Xor Filters. ACM J. Exp. Algorithmics, Vol. 25 (2020), 1--16. https://doi.org/10.1145/3376122
[26]
Thomas Mueller Graf and Daniel Lemire. 2022. Binary Fuse Filters: Fast and Smaller Than Xor Filters. ACM J. Exp. Algorithmics, Vol. 27 (2022), 1.5:1--1.5:15. https://doi.org/10.1145/3510449
[27]
Carmit Hazay and Martijn Stam (Eds.). 2023. EUROCRYPT 2023, Part I. LNCS, Vol. 14004. Springer, Heidelberg.
[28]
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). USENIX Association, Anaheim, CA, 3889--3905. https://www.usenix.org/conference/usenixsecurity23/presentation/henzinger
[29]
Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, and Amit Sahai. 2004. Batch codes and their applications. In 36th ACM STOC, László Babai (Ed.). ACM Press, 262--271. https://doi.org/10.1145/1007352.1007396
[30]
Dmitry Kogan and Henry Corrigan-Gibbs. 2021. Private Blocklist Lookups with Checklist, See citeNUSENIX21, 875--892.
[31]
Vladimir Kolesnikov, Mike Rosulek, and Ni Trieu. 2018. SWiM: Secure Wildcard Pattern Matching from OT Extension. In FC 2018 (LNCS, Vol. 10957), Sarah Meiklejohn and Kazue Sako (Eds.). Springer, Heidelberg, 222--240. https://doi.org/10.1007/978--3--662--58387--6_12
[32]
Eyal Kushilevitz and Rafail Ostrovsky. 1997. Replication is NOT Needed: SINGLE Database, Computationally-Private Information Retrieval. In 38th FOCS. IEEE Computer Society Press, 364--373. https://doi.org/10.1109/SFCS.1997.646125
[33]
Tancrède Lepoint, Sarvar Patel, Mariana Raykova, Karn Seth, and Ni Trieu. 2021. Private Join and Compute from PIR with Default. In ASIACRYPT 2021, Part II (LNCS, Vol. 13091), Mehdi Tibouchi and Huaxiong Wang (Eds.). Springer, Heidelberg, 605--634. https://doi.org/10.1007/978--3-030--92075--3_21
[34]
Baiyu Li, Daniele Micciancio, Mariana Raykova, and Mark Schultz-Wu. 2023. Hintless Single-Server Private Information Retrieval. Cryptology ePrint Archive, Paper 2023/1733. https://eprint.iacr.org/2023/1733 https://eprint.iacr.org/2023/1733.
[35]
Rasoul Akhavan Mahdavi and Florian Kerschbaum. 2022. Constant-weight PIR: Single-round Keyword PIR via Constant-weight Equality Operators. In USENIX Security 2022, Kevin R. B. Butler and Kurt Thomas (Eds.). USENIX Association, 1723--1740.
[36]
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. IEEE Computer Society Press, 930--947. https://doi.org/10.1109/SP46214.2022.9833700
[37]
Michael Mitzenmacher. 2002. Compressed bloom filters. IEEE/ACM Trans. Netw., Vol. 10, 5 (2002), 604--612. https://doi.org/10.1109/TNET.2002.803864
[38]
Christian Worm Mortensen, Rasmus Pagh, and Mihai Pundefinedtracccu. 2005. On Dynamic Range Reporting in One Dimension. In Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing (Baltimore, MD, USA) (STOC '05). Association for Computing Machinery, New York, NY, USA, 104--111. https://doi.org/10.1145/1060590.1060606
[39]
Muhammad Haris Mughees, Hao Chen, and Ling Ren. 2021. OnionPIR: Response Efficient Single-Server PIR. In ACM CCS 2021, Giovanni Vigna and Elaine Shi (Eds.). ACM Press, 2292--2306. https://doi.org/10.1145/3460120.3485381
[40]
Rasmus Pagh and Flemming Friche Rodler. 2004. Cuckoo hashing. J. Algorithms, Vol. 51, 2 (2004), 122--144. https://doi.org/10.1016/J.JALGOR.2003.12.002
[41]
Bijeeta Pal, Tal Daniel, Rahul Chatterjee, and Thomas Ristenpart. 2019. Beyond Credential Stuffing: Password Similarity Models Using Neural Networks. In 2019 IEEE Symposium on Security and Privacy (SP). 417--434. https://doi.org/10.1109/SP.2019.00056
[42]
Sarvar Patel, Giuseppe Persiano, Kevin Yeo, and Moti Yung. 2019. Mitigating Leakage in Secure Cloud-Hosted Data Structures: Volume-Hiding for Multi-Maps via Hashing. In ACM CCS 2019, Lorenzo Cavallaro, Johannes Kinder, XiaoFeng Wang, and Jonathan Katz (Eds.). ACM Press, 79--93. https://doi.org/10.1145/3319535.3354213
[43]
Sarvar Patel, Joon Young Seo, and Kevin Yeo. 2023. Dontextquoterightt be Dense: Efficient Keyword PIR for Sparse Databases. In 32nd USENIX Security Symposium (USENIX Security 23). USENIX Association, Anaheim, CA, 3853--3870. https://www.usenix.org/conference/usenixsecurity23/presentation/patel
[44]
Chris Peikert, Vinod Vaikuntanathan, and Brent Waters. 2008. A Framework for Efficient and Composable Oblivious Transfer. In CRYPTO 2008 (LNCS, Vol. 5157), David Wagner (Ed.). Springer, Heidelberg, 554--571. https://doi.org/10.1007/978--3--540--85174--5_31
[45]
Benny Pinkas, Mike Rosulek, Ni Trieu, and Avishay Yanai. 2020. PSI from PaXoS: Fast, Malicious Private Set Intersection. In EUROCRYPT 2020, Part II (LNCS, Vol. 12106), Anne Canteaut and Yuval Ishai (Eds.). Springer, Heidelberg, 739--767. https://doi.org/10.1007/978--3-030--45724--2_25
[46]
Benny Pinkas, Thomas Schneider, Christian Weinert, and Udi Wieder. 2018. Efficient Circuit-Based PSI via Cuckoo Hashing. In EUROCRYPT 2018, Part III (LNCS, Vol. 10822), Jesper Buus Nielsen and Vincent Rijmen (Eds.). Springer, Heidelberg, 125--157. https://doi.org/10.1007/978--3--319--78372--7_5
[47]
Oded Regev. 2005. On lattices, learning with errors, random linear codes, and cryptography. In 37th ACM STOC, Harold N. Gabow and Ronald Fagin (Eds.). ACM Press, 84--93. https://doi.org/10.1145/1060590.1060603
[48]
Ori Rottenstreich, Yossi Kanizo, and Isaac Keslassy. 2014. The Variable-Increment Counting Bloom Filter. IEEE/ACM Trans. Netw., Vol. 22, 4 (2014), 1092--1105. https://doi.org/10.1109/TNET.2013.2272604
[49]
Volker Strassen. 1969. Gaussian Elimination is Not Optimal. Numer. Math., Vol. 13, 4 (aug 1969), 354--356. https://doi.org/10.1007/BF02165411
[50]
Kurt Thomas, Frank Li, Ali Zand, Jacob Barrett, Juri Ranieri, Luca Invernizzi, Yarik Markov, Oxana Comanescu, Vijay Eranti, Angelika Moscicki, Daniel Margolis, Vern Paxson, and Elie Bursztein. 2017. Data Breaches, Phishing, or Malware? Understanding the Risks of Stolen Credentials. In Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security (Dallas, Texas, USA) (CCS '17). Association for Computing Machinery, New York, NY, USA, 1421--1434. https://doi.org/10.1145/3133956.3134067
[51]
Kevin Yeo. 2023. Lower Bounds for (Batch) PIR with Private Preprocessing, See citeNEC23--1, 518--550. https://doi.org/10.1007/978--3-031--30545-0_18
[52]
Mingxun Zhou, Wei-Kai Lin, Yiannis Tselekounis, and Elaine Shi. 2023. Optimal Single-Server Private Information Retrieval, See citeNEC23--1, 395--425. https://doi.org/10.1007/978--3-031--30545-0_14
[53]
Mingxun Zhou, Andrew Park, Elaine Shi, and Wenting Zheng. 2023. Piano: Extremely Simple, Single-Server PIR with Sublinear Server Computation. Cryptology ePrint Archive, Paper 2023/452. https://eprint.iacr.org/2023/452 https://eprint.iacr.org/2023/452.
Index Terms
- Call Me By My Name: Simple, Practical Private Information Retrieval for Keyword Queries
Recommendations
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, ...
Quantum Private Information Retrieval has Linear Communication Complexity
In private information retrieval (PIR), a client queries an $$n$$ n -bit database in order to retrieve an entry of her choice, while maintaining privacy of her query value. Chor et al. [J ACM 45(6):965---981, 1998 ] showed that, in the information-theoretical ...
Private Information Retrieval with Result Verification for More Servers
Applied Cryptography and Network SecurityAbstractPrivate information retrieval (PIR) allows a client to retrieve an element from a database without revealing which element is downloaded to the database servers. PIR protocols with unconditional privacy and sublinear (in n) communication ...
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 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 09 December 2024
Check for updates
Badges
Author Tags
Qualifiers
- Research-article
Funding Sources
- Fundação para a Ciência e a Tecnologia (FCT)
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
- View Citations1Total Citations
- 222Total Downloads
- Downloads (Last 12 months)222
- Downloads (Last 6 weeks)122
Reflects downloads up to 08 Mar 2025
Other Metrics
Citations
Cited By
View all- Luo MWang M(2025)Faster Spiral: Low-Communication, High-Rate Private Information RetrievalCryptography10.3390/cryptography90100139:1(13)Online publication date: 21-Feb-2025
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