{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,4]],"date-time":"2026-08-04T21:22:27Z","timestamp":1785878547446,"version":"3.56.0"},"publisher-location":"New York, NY, USA","reference-count":53,"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:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia (FCT)","award":["6817 - DCRRNI ID"],"award-info":[{"award-number":["6817 - DCRRNI ID"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,12,2]]},"DOI":"10.1145\/3658644.3670271","type":"proceedings-article","created":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T12:19:20Z","timestamp":1733746760000},"page":"4107-4121","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":18,"title":["Call Me By My Name: Simple, Practical Private Information Retrieval for Keyword Queries"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3333-7764","authenticated-orcid":false,"given":"Sofia","family":"Celi","sequence":"first","affiliation":[{"name":"Brave Software, Lisbon, Portugal"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9157-3821","authenticated-orcid":false,"given":"Alex","family":"Davidson","sequence":"additional","affiliation":[{"name":"Universidade NOVA de Lisboa & NOVA LINCS, Lisbon, Portugal"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,12,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1515\/jmc-2015-0016"},{"key":"e_1_3_2_1_2_1","volume-title":"See citeNUSENIX21","author":"Ali Asra","year":"1811","unstructured":"Asra Ali, Tancr\u00e8de Lepoint, Sarvar Patel, Mariana Raykova, Phillipp Schoppmann, Karn Seth, and Kevin Yeo. 2021. Communication-Computation Trade-offs in PIR, See citeNUSENIX21, 1811--1828."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380842"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.00062"},{"key":"e_1_3_2_1_5_1","volume-title":"Amazon EC2 On-Demand Pricing. https:\/\/aws.amazon.com\/ec2\/pricing\/on-demand\/ https:\/\/aws.amazon.com\/ec2\/pricing\/on-demand\/. Accessed 18th","author":"AWS.","year":"2024","unstructured":"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.."},{"key":"e_1_3_2_1_6_1","unstructured":"Michael Bailey and Rachel Greenstadt (Eds.). 2021. USENIX Security 2021. USENIX Association."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/11841036_61"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2004.10129096"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Sof\u00eda 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.","DOI":"10.1145\/3658644.3670271"},{"key":"e_1_3_2_1_11_1","unstructured":"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."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1995.492461"},{"key":"e_1_3_2_1_13_1","volume-title":"32nd USENIX Security Symposium (USENIX Security 23)","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 32nd USENIX Security Symposium (USENIX Security 23). USENIX Association, Anaheim, CA, 3835--3851. https:\/\/www.usenix.org\/conference\/usenixsecurity23\/presentation\/colombo"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747--7171(08)80013--2"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3-031-07085--3_1"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3-030--45721--1_3"},{"key":"e_1_3_2_1_17_1","volume-title":"Part II (LNCS","volume":"278","author":"Davidson Alex","year":"2017","unstructured":"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."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.56553\/popets-2023-0022"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142477"},{"key":"e_1_3_2_1_20_1","volume-title":"Dillinger and Stefan Walzer","author":"Peter","year":"2021","unstructured":"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"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516701"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2674005.2674994"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--540--30576--7_17"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--642--55220--5_35"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3376122"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3510449"},{"key":"e_1_3_2_1_27_1","volume-title":"EUROCRYPT","volume":"14004","author":"Hazay Carmit","year":"2023","unstructured":"Carmit Hazay and Martijn Stam (Eds.). 2023. EUROCRYPT 2023, Part I. LNCS, Vol. 14004. Springer, Heidelberg."},{"key":"e_1_3_2_1_28_1","volume-title":"One Server for the Price of Two: Simple and Fast Single-Server Private Information Retrieval. In 32nd USENIX Security Symposium (USENIX Security 23)","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 32nd USENIX Security Symposium (USENIX Security 23). USENIX Association, Anaheim, CA, 3889--3905. https:\/\/www.usenix.org\/conference\/usenixsecurity23\/presentation\/henzinger"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007396"},{"key":"e_1_3_2_1_30_1","unstructured":"Dmitry Kogan and Henry Corrigan-Gibbs. 2021. Private Blocklist Lookups with Checklist See citeNUSENIX21 875--892."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-58387-6_12"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1997.646125"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-92075-3_21"},{"key":"e_1_3_2_1_34_1","unstructured":"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."},{"key":"e_1_3_2_1_35_1","volume-title":"USENIX Security","author":"Mahdavi Rasoul Akhavan","year":"2022","unstructured":"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."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP46214.2022.9833700"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2002.803864"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060606"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3485381"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/J.JALGOR.2003.12.002"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2019.00056"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3354213"},{"key":"e_1_3_2_1_43_1","volume-title":"32nd USENIX Security Symposium (USENIX Security 23)","author":"Patel Sarvar","year":"2023","unstructured":"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"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85174-5_31"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3-030--45724--2_25"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-78372-7_5"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060603"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2013.2272604"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02165411"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134067"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","unstructured":"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","DOI":"10.1007\/978--3-031--30545-0_18"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","unstructured":"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","DOI":"10.1007\/978--3-031--30545-0_14"},{"key":"e_1_3_2_1_53_1","volume-title":"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.","author":"Zhou Mingxun","year":"2023","unstructured":"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."}],"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.3670271","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3658644.3670271","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T06:01:35Z","timestamp":1755842495000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3658644.3670271"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,2]]},"references-count":53,"alternative-id":["10.1145\/3658644.3670271","10.1145\/3658644"],"URL":"https:\/\/doi.org\/10.1145\/3658644.3670271","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"}}]}}