{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,14]],"date-time":"2026-10-14T04:03:56Z","timestamp":1791950636043,"version":"4.3.4"},"publisher-location":"New York, NY, USA","reference-count":78,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T00:00:00Z","timestamp":1733097600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100006374","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-2140975, CNS-2318701"],"award-info":[{"award-number":["CNS-2140975, CNS-2318701"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,12,2]]},"DOI":"10.1145\/3658644.3690328","type":"proceedings-article","created":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T12:19:20Z","timestamp":1733746760000},"page":"1463-1477","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["<scp>Respire:<\/scp>\n            High-Rate PIR for Databases with Small Records"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-0936-4958","authenticated-orcid":false,"given":"Alexander","family":"Burton","sequence":"first","affiliation":[{"name":"UT Austin, Austin, Texas, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-7693-7633","authenticated-orcid":false,"given":"Samir Jordan","family":"Menon","sequence":"additional","affiliation":[{"name":"Blyss, San Francisco, California, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5191-692X","authenticated-orcid":false,"given":"David J.","family":"Wu","sequence":"additional","affiliation":[{"name":"UT Austin, Austin, Texas, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,12,9]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Amr El Abbadi, and Trinabh Gupta","author":"Ahmad Ishtiyaque","year":"2021","unstructured":"Ishtiyaque Ahmad, Yuntian Yang, Divyakant Agrawal, Amr El Abbadi, and Trinabh Gupta. 2021. Addra: Metadata-private voice communication over fully untrusted infrastructure. In OSDI."},{"key":"e_1_3_2_1_2_1","volume-title":"Communication-Computation Trade-offs in PIR. In USENIX Security Symposium.","author":"Ali Asra","year":"2021","unstructured":"Asra Ali, Tancr\u00e8de Lepoint, Sarvar Patel, Mariana Raykova, Phillipp Schoppmann, Karn Seth, and Kevin Yeo. 2021. Communication-Computation Trade-offs in PIR. In USENIX Security Symposium."},{"key":"e_1_3_2_1_3_1","volume-title":"Setty","author":"Angel Sebastian","year":"2018","unstructured":"Sebastian Angel, Hao Chen, Kim Laine, and Srinath T. V. Setty. 2018. PIR with Compressed Queries and Amortized Query Processing. In IEEE S&P."},{"key":"e_1_3_2_1_4_1","volume-title":"Setty","author":"Angel Sebastian","year":"2016","unstructured":"Sebastian Angel and Srinath T. V. Setty. 2016. Unobservable Communication over Fully Untrusted Infrastructure. In OSDI."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2005.03.002"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Amos Beimel Yuval Ishai Eyal Kushilevitz and Ilan Orlov. 2012. Share Conversion and Private Information Retrieval. In CCC.","DOI":"10.1109\/CCC.2012.23"},{"key":"e_1_3_2_1_7_1","unstructured":"Amos Beimel Yuval Ishai Eyal Kushilevitz and Jean-Franccois Raymond. 2002. Breaking the O(n1\/(2k-1)) Barrier for Information-Theoretic Private Information Retrieval. In FOCS."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Amos Beimel Yuval Ishai and Tal Malkin. 2000. Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing. In CRYPTO.","DOI":"10.1007\/3-540-44598-6_4"},{"key":"e_1_3_2_1_9_1","volume-title":"Yael Tauman Kalai, and Omer Paneth","author":"Ben-David Shany","year":"2022","unstructured":"Shany Ben-David, Yael Tauman Kalai, and Omer Paneth. 2022. Verifiable Private Information Retrieval. In TCC."},{"key":"e_1_3_2_1_10_1","volume-title":"Workshop record of SASC","volume":"8","author":"Bernstein Daniel J.","year":"2008","unstructured":"Daniel J. Bernstein. 2008. ChaCha, a variant of Salsa20. In Workshop record of SASC, Vol. 8. 3--5."},{"key":"e_1_3_2_1_11_1","volume-title":"Joon Young Seo, and Kevin Yeo","author":"Bienstock Alexander","year":"2024","unstructured":"Alexander Bienstock, Sarvar Patel, Joon Young Seo, and Kevin Yeo. 2024. Batch PIR and Labeled PSI with Oblivious Ciphertext Compression. In USENIX Security."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Fabian Boemer Sejun Kim Gelila Seifu Fillipe D. M. de Souza and Vinodh Gopal. 2021. Intel HEXL: Accelerating Homomorphic Encryption with Intel AVX512-IFMA52. In WAHC.","DOI":"10.1145\/3474366.3486926"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Elette Boyle Geoffroy Couteau and Pierre Meyer. 2022. Sublinear Secure Computation from New Assumptions. In TCC.","DOI":"10.1007\/978-3-031-22365-5_5"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Elette Boyle Niv Gilboa and Yuval Ishai. 2016. Function Secret Sharing: Improvements and Extensions. In ACM CCS.","DOI":"10.1145\/2976749.2978429"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Elette Boyle Yuval Ishai Rafael Pass and Mary Wootters. 2017. Can We Access a Database Both Locally and Privately?. In TCC.","DOI":"10.1007\/978-3-319-70503-3_22"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Zvika Brakerski. 2012. Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP. In CRYPTO.","DOI":"10.1007\/978-3-642-32009-5_50"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Zvika Brakerski Craig Gentry and Vinod Vaikuntanathan. 2012. (Leveled) fully homomorphic encryption without bootstrapping. In ITCS.","DOI":"10.1145\/2090236.2090262"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Zvika Brakerski and Vinod Vaikuntanathan. 2011. Efficient Fully Homomorphic Encryption from (Standard) LWE. In FOCS.","DOI":"10.1109\/FOCS.2011.12"},{"key":"e_1_3_2_1_19_1","volume":"202","author":"Burton Alexander","unstructured":"Alexander Burton, Samir Jordan Menon, and David J. Wu. 2024. textscRespire: High-Rate PIR for Databases with Small Records. In ACM CCS. Available at https:\/\/eprint.iacr.org\/2024\/1165.pdf.","journal-title":"David J. Wu."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Christian Cachin Silvio Micali and Markus Stadler. 1999. Computationally Private Information Retrieval with Polylogarithmic Communication. In EUROCRYPT.","DOI":"10.1007\/3-540-48910-X_28"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"Ran Canetti Justin Holmgren and Silas Richelson. 2017. Towards Doubly Efficient Private Information Retrieval. In TCC.","DOI":"10.1007\/978-3-319-70503-3_23"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Yan-Cheng Chang. 2004. Single Database Private Information Retrieval with Logarithmic Communication. In ACISP.","DOI":"10.1007\/978-3-540-27800-9_5"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Melissa Chase Sanjam Garg Mohammad Hajiabadi Jialin Li and Peihan Miao. 2021. Amortizing Rate-1 OT and Applications to PIR and PSI. In TCC.","DOI":"10.1007\/978-3-030-90456-2_5"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"Hao Chen Ilaria Chillotti and Ling Ren. 2019. Onion Ring ORAM: Efficient Constant Bandwidth Oblivious RAM from (Leveled) TFHE. In ACM CCS.","DOI":"10.1145\/3319535.3354226"},{"key":"e_1_3_2_1_25_1","volume-title":"TFHE: Fast Fully Homomorphic Encryption over the Torus. IACR Cryptol. ePrint Arch.","author":"Chillotti Ilaria","year":"2018","unstructured":"Ilaria Chillotti, Nicolas Gama, Mariya Georgieva, and Malika Izabach\u00e8ne. 2018. TFHE: Fast Fully Homomorphic Encryption over the Torus. IACR Cryptol. ePrint Arch. (2018)."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-019-09319-x"},{"key":"e_1_3_2_1_27_1","unstructured":"Benny Chor Oded Goldreich Eyal Kushilevitz and Madhu Sudan. 1995. Private Information Retrieval. In FOCS."},{"key":"e_1_3_2_1_28_1","volume-title":"USENIX Security Symposium.","author":"Colombo Simone","year":"2023","unstructured":"Simone Colombo, Kirill Nikitin, Henry Corrigan-Gibbs, David J. Wu, and Bryan Ford. 2023. Authenticated private information retrieval. In USENIX Security Symposium."},{"key":"e_1_3_2_1_29_1","volume-title":"Single-Server Private Information Retrieval. Proc. Priv. Enhancing Technol.","volume":"2023","author":"Davidson Alex","year":"2023","unstructured":"Alex Davidson, Gonccalo Pestana, and Sof\u00eda Celi. 2023. FrodoPIR: Simple, Scalable, Single-Server Private Information Retrieval. Proc. Priv. Enhancing Technol., Vol. 2023, 1 (2023)."},{"key":"e_1_3_2_1_30_1","volume-title":"USENIX Security Symposium","author":"de Castro Leo","year":"2024","unstructured":"Leo de Castro and Keewoo Lee. 2024. VeriSimplePIR: Verifiability in SimplePIR at No Online Cost for Honest Servers. USENIX Security Symposium (2024)."},{"key":"e_1_3_2_1_31_1","unstructured":"Leo de Castro Kevin Lewi and Edward Suh. 2024. WhisPIR: Stateless Private Information Retrieval with Low Communication. IACR Cryptol. ePrint Arch. (2024)."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","unstructured":"Marian Dietz and Stefano Tessaro. 2024. Fully Malicious Authenticated PIR. In CRYPTO.","DOI":"10.1007\/978-3-031-68400-5_4"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"crossref","unstructured":"Nico D\u00f6ttling Sanjam Garg Yuval Ishai Giulio Malavolta Tamer Mour and Rafail Ostrovsky. 2019. Trapdoor Hash Functions and Their Applications. In CRYPTO.","DOI":"10.1007\/978-3-030-26954-8_1"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"crossref","unstructured":"Klim Efremenko. 2009. 3-query locally decodable codes of subexponential length. In STOC.","DOI":"10.1145\/1536414.1536422"},{"key":"e_1_3_2_1_35_1","unstructured":"Junfeng Fan and Frederik Vercauteren. 2012. Somewhat Practical Fully Homomorphic Encryption. IACR Cryptol. ePrint Arch. (2012)."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"crossref","unstructured":"Craig Gentry and Shai Halevi. 2019. Compressible FHE with Applications to PIR. In TCC.","DOI":"10.1007\/978-3-030-36033-7_17"},{"key":"e_1_3_2_1_37_1","volume-title":"Smart","author":"Gentry Craig","year":"2012","unstructured":"Craig Gentry, Shai Halevi, Chris Peikert, and Nigel P. Smart. 2012. Ring Switching in BGV-Style Homomorphic Encryption. In SCN."},{"key":"e_1_3_2_1_38_1","volume-title":"Smart","author":"Gentry Craig","year":"2012","unstructured":"Craig Gentry, Shai Halevi, and Nigel P. Smart. 2012. Fully Homomorphic Encryption with Polylog Overhead. In EUROCRYPT."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"crossref","unstructured":"Craig Gentry and Zulfikar Ramzan. 2005. Single-Database Private Information Retrieval with Constant Communication Rate. In ICALP.","DOI":"10.1007\/11523468_65"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"crossref","unstructured":"Craig Gentry Amit Sahai and Brent Waters. 2013. Homomorphic Encryption from Learning with Errors: Conceptually-Simpler Asymptotically-Faster Attribute-Based. In CRYPTO.","DOI":"10.1007\/978-3-642-40041-4_5"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"crossref","unstructured":"Ashrujit Ghoshal Mingxun Zhou and Elaine Shi. 2024. Efficient Pre-processing PIR Without Public-Key Cryptography. In EUROCRYPT.","DOI":"10.1007\/978-3-031-58751-1_8"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"crossref","unstructured":"Niv Gilboa and Yuval Ishai. 2014. Distributed Point Functions and Their Applications. In EUROCRYPT.","DOI":"10.1007\/978-3-642-55220-5_35"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"crossref","unstructured":"Jens Groth Aggelos Kiayias and Helger Lipmaa. 2010. Multi-query Computationally-Private Information Retrieval with Constant Communication Rate. In PKC.","DOI":"10.1007\/978-3-642-13013-7_7"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.2478\/popets-2019-0061"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1515\/popets-2016-0036"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"crossref","unstructured":"Alexandra Henzinger Emma Dauterman Henry Corrigan-Gibbs and Nickolai Zeldovich. 2023. Private Web Search with Tiptoe. In SOSP.","DOI":"10.1145\/3600006.3613134"},{"key":"e_1_3_2_1_47_1","volume-title":"One Server for the Price of Two: Simple and Fast Single-Server Private Information Retrieval. In USENIX Security Symposium.","author":"Henzinger Alexandra","year":"2023","unstructured":"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 USENIX Security Symposium."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"crossref","unstructured":"Yuval Ishai Eyal Kushilevitz Rafail Ostrovsky and Amit Sahai. 2004. Batch codes and their applications. In STOC.","DOI":"10.1145\/1007352.1007396"},{"key":"e_1_3_2_1_49_1","unstructured":"Eyal Kushilevitz and Rafail Ostrovsky. 1997. Replication is NOT Needed: SINGLE Database Computationally-Private Information Retrieval. In FOCS."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1515\/popets-2016-0008"},{"key":"e_1_3_2_1_51_1","unstructured":"Baiyu Li Daniele Micciancio Mariana Raykova and Mark Schultz. 2024. Hintless Single-Server Private Information Retrieval. In CRYPTO."},{"key":"e_1_3_2_1_52_1","unstructured":"Lucy Li Bijeeta Pal Junade Ali Nick Sullivan Rahul Chatterjee and Thomas Ristenpart. 2019. Protocols for Checking Compromised Credentials. In ACM CCS."},{"key":"e_1_3_2_1_53_1","unstructured":"Wei-Kai Lin Ethan Mook and Daniel Wichs. 2023. Doubly Efficient Private Information Retrieval and Fully Homomorphic RAM Computation from Ring LWE. In STOC."},{"key":"e_1_3_2_1_54_1","volume-title":"PIRANA: Faster Multi-query PIR via Constant-weight Codes","author":"Liu Jian","year":"2024","unstructured":"Jian Liu, Jingyu Li, Di Wu, and Kui Ren. 2024. PIRANA: Faster Multi-query PIR via Constant-weight Codes. In IEEE S&P."},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"crossref","unstructured":"Patrick Longa and Michael Naehrig. 2016. Speeding up the Number Theoretic Transform for Faster Ideal Lattice-Based Cryptography. In CANS.","DOI":"10.1007\/978-3-319-48965-0_8"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"crossref","unstructured":"Wouter Lueks and Ian Goldberg. 2015. Sublinear Scaling for Multi-Client Private Information Retrieval. In Financial Cryptography and Data Security.","DOI":"10.1007\/978-3-662-47854-7_10"},{"key":"e_1_3_2_1_57_1","volume-title":"SWIFFT: A Modest Proposal for FFT Hashing. In Fast Software Encryption.","author":"Lyubashevsky Vadim","year":"2008","unstructured":"Vadim Lyubashevsky, Daniele Micciancio, Chris Peikert, and Alon Rosen. 2008. SWIFFT: A Modest Proposal for FFT Hashing. In Fast Software Encryption."},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"crossref","unstructured":"Vadim Lyubashevsky Chris Peikert and Oded Regev. 2010. On Ideal Lattices and Learning with Errors over Rings. In EUROCRYPT.","DOI":"10.1007\/978-3-642-13190-5_1"},{"key":"e_1_3_2_1_59_1","volume-title":"Proc. Priv. Enhancing Technol.","volume":"2016","author":"Melchor Carlos Aguilar","year":"2016","unstructured":"Carlos Aguilar Melchor, Joris Barrier, Laurent Fousse, and Marc-Olivier Killijian. 2016. XPIR : Private Information Retrieval for Everyone. Proc. Priv. Enhancing Technol., Vol. 2016, 2 (2016)."},{"key":"e_1_3_2_1_60_1","volume":"202","author":"Menon Samir Jordan","unstructured":"Samir Jordan Menon and David J. Wu. 2022. SPIRAL: Fast, High-Rate Single-Server PIR via FHE Composition. In IEEE S&P.","journal-title":"David J. Wu."},{"key":"e_1_3_2_1_61_1","volume":"202","author":"Menon Samir Jordan","unstructured":"Samir Jordan Menon and David J. Wu. 2022. SPIRAL: Fast, High-Rate Single-Server PIR via FHE Composition. In IEEE S&P. Available at https:\/\/github.com\/blyssprivacy\/sdk\/tree\/c93fff0.","journal-title":"David J. Wu."},{"key":"e_1_3_2_1_62_1","volume":"202","author":"Menon Samir Jordan","unstructured":"Samir Jordan Menon and David J. Wu. 2024. YPIR: High-Throughput Single-Server PIR with Silent Preprocessing. In USENIX Security Symposium.","journal-title":"David J. Wu."},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"crossref","unstructured":"Daniele Micciancio and Chris Peikert. 2012. Trapdoors for Lattices: Simpler Tighter Faster Smaller. In EUROCRYPT.","DOI":"10.1007\/978-3-642-29011-4_41"},{"key":"e_1_3_2_1_64_1","volume-title":"PIR-Tor: Scalable Anonymous Communication Using Private Information Retrieval. In USENIX Security Symposium.","author":"Mittal Prateek","year":"2011","unstructured":"Prateek Mittal, Femi G. Olumofin, Carmela Troncoso, Nikita Borisov, and Ian Goldberg. 2011. PIR-Tor: Scalable Anonymous Communication Using Private Information Retrieval. In USENIX Security Symposium."},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"crossref","unstructured":"Muhammad Haris Mughees Hao Chen and Ling Ren. 2021. OnionPIR: Response Efficient Single-Server PIR. In ACM CCS.","DOI":"10.1145\/3460120.3485381"},{"key":"e_1_3_2_1_66_1","volume-title":"Vectorized Batch Private Information Retrieval","author":"Mughees Muhammad Haris","unstructured":"Muhammad Haris Mughees and Ling Ren. 2023. Vectorized Batch Private Information Retrieval. In IEEE S&P."},{"key":"e_1_3_2_1_67_1","volume-title":"Simple and practical amortized sublinear private information retrieval. Cryptology ePrint Archive","author":"Mughees Muhammad Haris","year":"2023","unstructured":"Muhammad Haris Mughees, I Sun, and Ling Ren. 2023. Simple and practical amortized sublinear private information retrieval. Cryptology ePrint Archive (2023)."},{"key":"e_1_3_2_1_68_1","unstructured":"Hiroki Okada Rachel Player Simon Pohmann and Christian Weinert. 2023. Towards Practical Doubly-Efficient Private Information Retrieval. IACR Cryptol. ePrint Arch. (2023)."},{"key":"e_1_3_2_1_69_1","volume-title":"Skeith III","author":"Ostrovsky Rafail","year":"2007","unstructured":"Rafail Ostrovsky and William E. Skeith III. 2007. A Survey of Single-Database Private Information Retrieval: Techniques and Applications. In PKC."},{"key":"e_1_3_2_1_70_1","doi-asserted-by":"crossref","unstructured":"Rasmus Pagh and Flemming Friche Rodler. 2001. Cuckoo Hashing. In ESA.","DOI":"10.1007\/3-540-44676-1_10"},{"key":"e_1_3_2_1_71_1","doi-asserted-by":"crossref","unstructured":"Jeongeun Park and Mehdi Tibouchi. 2020. SHECS-PIR: Somewhat Homomorphic Encryption-Based Compact and Scalable Private Information Retrieval. In ESORICS.","DOI":"10.1007\/978-3-030-59013-0_5"},{"key":"e_1_3_2_1_72_1","doi-asserted-by":"crossref","unstructured":"Oded Regev. 2005. On lattices learning with errors random linear codes and cryptography. In STOC.","DOI":"10.1145\/1060590.1060603"},{"key":"e_1_3_2_1_73_1","volume-title":"USENIX Security Symposium.","author":"Thomas Kurt","year":"2019","unstructured":"Kurt Thomas, Jennifer Pullman, Kevin Yeo, Ananth Raghunathan, Patrick Gage Kelley, Luca Invernizzi, Borbala Benko, Tadek Pietraszek, Sarvar Patel, Dan Boneh, and Elie Bursztein. 2019. Protecting accounts from credential stuffing with password breach alerting. In USENIX Security Symposium."},{"key":"e_1_3_2_1_74_1","doi-asserted-by":"crossref","unstructured":"Xingfeng Wang and Liang Zhao. 2018. Verifiable Single-Server Private Information Retrieval. In ICICS.","DOI":"10.1007\/978-3-030-01950-1_28"},{"key":"e_1_3_2_1_75_1","volume-title":"Woodruff and Sergey Yekhanin","author":"David","year":"2005","unstructured":"David P. Woodruff and Sergey Yekhanin. 2005. A Geometric Approach to Information-Theoretic Private Information Retrieval. In CCC."},{"key":"e_1_3_2_1_76_1","doi-asserted-by":"crossref","unstructured":"Sergey Yekhanin. 2007. Towards 3-query locally decodable codes of subexponential length. In STOC.","DOI":"10.1145\/1250790.1250830"},{"key":"e_1_3_2_1_77_1","doi-asserted-by":"crossref","unstructured":"Kevin Yeo. 2023. Cuckoo Hashing in Cryptography: Optimal Parameters Robustness and Applications. In CRYPTO.","DOI":"10.1007\/978-3-031-38551-3_7"},{"key":"e_1_3_2_1_78_1","volume-title":"Piano: Extremely Simple, Single-Server PIR with Sublinear Server Computation","author":"Zhou Mingxun","year":"2024","unstructured":"Mingxun Zhou, Andrew Park, Elaine Shi, and Wenting Zheng. 2024. Piano: Extremely Simple, Single-Server PIR with Sublinear Server Computation. In IEEE S&P."}],"event":{"name":"CCS '24: ACM SIGSAC Conference on Computer and Communications Security","location":"Salt Lake City UT USA","acronym":"CCS '24","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3658644.3690328","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3658644.3690328","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T06:15:23Z","timestamp":1755843323000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3658644.3690328"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,2]]},"references-count":78,"alternative-id":["10.1145\/3658644.3690328","10.1145\/3658644"],"URL":"https:\/\/doi.org\/10.1145\/3658644.3690328","relation":{},"subject":[],"published":{"date-parts":[[2024,12,2]]},"assertion":[{"value":"2024-12-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}