{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,15]],"date-time":"2026-08-15T17:26:29Z","timestamp":1786814789628,"version":"build-2736575974"},"publisher-location":"New York, NY, USA","reference-count":59,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,11,13]],"date-time":"2022-11-13T00:00:00Z","timestamp":1668297600000},"content-version":"vor","delay-in-days":366,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["FA8750-19-C-0502"],"award-info":[{"award-number":["FA8750-19-C-0502"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,11,12]]},"DOI":"10.1145\/3460120.3484760","type":"proceedings-article","created":{"date-parts":[[2021,11,13]],"date-time":"2021-11-13T12:05:34Z","timestamp":1636805134000},"page":"1135-1150","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":120,"title":["Labeled PSI from Homomorphic Encryption with Reduced Computation and Communication"],"prefix":"10.1145","author":[{"given":"Kelong","family":"Cong","sequence":"first","affiliation":[{"name":"imec-COSIC, KU Leuven, Leuven, Belgium"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Radames Cruz","family":"Moreno","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mariana Botelho","family":"da Gama","sequence":"additional","affiliation":[{"name":"imec-COSIC, KU Leuven, Leuven, Belgium"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wei","family":"Dai","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ilia","family":"Iliashenko","sequence":"additional","affiliation":[{"name":"imec-COSIC, KU Leuven, Leuven, Belgium"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kim","family":"Laine","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Rosenberg","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, MD, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,11,13]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1515\/jmc-2015-0016"},{"key":"e_1_3_2_2_2_1","unstructured":"Junade Ali. 2018. Validating Leaked Passwords with k-Anonymity. https:\/\/blog.cloudflare.com\/validating-leaked-passwords-with-k-anonymity\/. Accessed: 2021-04--26."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.00062"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-19379-8_10"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516734"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32009-5_50"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090262"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/2033036.2033075"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/120868669"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/36.2.117"},{"key":"e_1_3_2_2_11_1","first-page":"3","article-title":"Some extremal postage stamp bases","volume":"13","author":"Challis Michael F","year":"2010","unstructured":"Michael F Challis and John P Robinson. 2010. Some extremal postage stamp bases. Journal of Integer Sequences, Vol. 13, 2 (2010), 3.","journal-title":"Journal of Integer Sequences"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-56877-1_2"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243836"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134061"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53887-6_1"},{"key":"e_1_3_2_2_16_1","unstructured":"Benny Chor Niv Gilboa and Moni Naor. 1997. Private information retrieval by keywords .Citeseer."},{"key":"e_1_3_2_2_17_1","unstructured":"Craig Costello and Patrick Longa. 2015. FourQ: four-dimensional decompositions on a Q-curve over the Mersenne prime. Cryptology ePrint Archive Report 2015\/565. https:\/\/eprint.iacr.org\/2015\/565 ."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055638"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516701"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46800-5_24"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2674005.2674994"},{"key":"e_1_3_2_2_22_1","unstructured":"Junfeng Fan and Frederik Vercauteren. 2012. Somewhat Practical Fully Homomorphic Encryption. Cryptology ePrint Archive Report 2012\/144. http:\/\/eprint.iacr.org\/."},{"key":"e_1_3_2_2_23_1","volume-title":"Keyword Search and Oblivious Pseudorandom Functions. In TCC 2005 (LNCS","volume":"324","author":"Freedman Michael J.","year":"2005","unstructured":"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."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--540--24676--3_1"},{"key":"e_1_3_2_2_25_1","first-page":"169","article-title":"Fully homomorphic encryption using ideal lattices","volume":"9","author":"Gentry Craig","year":"2009","unstructured":"Craig Gentry. 2009. Fully homomorphic encryption using ideal lattices.. In STOC, Vol. 9. 169--178.","journal-title":"STOC"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32009-5_49"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--642--40041--4"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2021.23159"},{"key":"e_1_3_2_2_29_1","unstructured":"Shai Halevi and Victor Shoup. 2020. Design and implementation of HElib: a homomorphic encryption library. Cryptology ePrint Archive Report 2020\/1481. https:\/\/eprint.iacr.org\/2020\/1481."},{"key":"e_1_3_2_2_30_1","volume-title":"Theory of Cryptography","author":"Hazay Carmit","unstructured":"Carmit Hazay and Yehuda Lindell. 2008. Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries. In Theory of Cryptography, Ran Canetti (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 155--175."},{"key":"e_1_3_2_2_31_1","volume-title":"NDSS","author":"Huang Yan","year":"2012","unstructured":"Yan Huang, David Evans, and Jonathan Katz. 2012. Private Set Intersection: Are Garbled Circuits Better than Custom Protocols?. In NDSS 2012. The Internet Society."},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/336992.337012"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--540--45146--4_9"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.5555\/1885535.1885573"},{"key":"e_1_3_2_2_35_1","volume-title":"USENIX Security","author":"Kales Daniel","year":"2019","unstructured":"Daniel Kales, Christian Rechberger, Thomas Schneider, Matthias Senker, and Christian Weinert. 2019. Mobile Private Contact Discovery at Scale. In USENIX Security 2019, Nadia Heninger and Patrick Traynor (Eds.). USENIX Association, 1447--1464."},{"key":"e_1_3_2_2_36_1","volume-title":"Password Monitor: Safeguarding passwords in Microsoft Edge. https:\/\/www.microsoft.com\/en-us\/research\/blog\/password-monitor-safeguarding-passwords-in-microsoft-edge\/. Accessed: 2021-04--26.","author":"Kannepalli Sreekanth","year":"2021","unstructured":"Sreekanth Kannepalli, Kim Laine, and Radames Cruz Moreno. 2021. Password Monitor: Safeguarding passwords in Microsoft Edge. https:\/\/www.microsoft.com\/en-us\/research\/blog\/password-monitor-safeguarding-passwords-in-microsoft-edge\/. Accessed: 2021-04--26."},{"key":"e_1_3_2_2_37_1","unstructured":"Andrey Kim Yuriy Polyakov and Vincent Zucca. 2021. Revisiting Homomorphic Encryption Schemes for Finite Fields. Cryptology ePrint Archive Report 2021\/204. https:\/\/eprint.iacr.org\/2021\/204."},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1515\/popets-2017-0044"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978381"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2535925"},{"key":"e_1_3_2_2_41_1","unstructured":"Moxie Marlinspike. 2014. The Difficulty Of Private Contact Discovery. A company sponsored blog post. https:\/\/signal.org\/blog\/contact-discovery\/."},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.1986.10022"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/972639.972643"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/948005.948051"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-52153-4_22"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1137\/0202007"},{"key":"e_1_3_2_2_47_1","volume-title":"Malicious Private Set Intersection. In EUROCRYPT","author":"Pinkas Benny","year":"2020","unstructured":"Benny Pinkas, Mike Rosulek, Ni Trieu, and Avishay Yanai. 2020. PSI from PaXoS: Fast, Malicious Private Set Intersection. In EUROCRYPT 2020, Part II (LNCS ), Vincent Rijmen and Yuval Ishai (Eds.). Springer, Heidelberg, 739--767."},{"key":"e_1_3_2_2_48_1","volume-title":"24th USENIX Security Symposium (USENIX Security 15)","author":"Pinkas Benny","year":"2015","unstructured":"Benny Pinkas, Thomas Schneider, Gil Segev, and Michael Zohner. 2015. Phasing: Private set intersection using permutation-based hashing. In 24th USENIX Security Symposium (USENIX Security 15). 515--530."},{"key":"e_1_3_2_2_49_1","volume-title":"Secure Two-Party Computation Is Practical. In ASIACRYPT 2009 (LNCS","volume":"267","author":"Pinkas Benny","unstructured":"Benny Pinkas, Thomas Schneider, Nigel P. Smart, and Stephen C. Williams. 2009. Secure Two-Party Computation Is Practical. In ASIACRYPT 2009 (LNCS, Vol. 5912), Mitsuru Matsui (Ed.). Springer, Heidelberg, 250--267."},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-78372-7_5"},{"key":"e_1_3_2_2_51_1","volume-title":"USENIX Security","author":"Pinkas Benny","year":"2014","unstructured":"Benny Pinkas, Thomas Schneider, and Michael Zohner. 2014. Faster Private Set Intersection Based on OT Extension. In USENIX Security 2014, Kevin Fu and Jaeyeon Jung (Eds.). USENIX Association, 797--812."},{"key":"e_1_3_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060603"},{"key":"e_1_3_2_2_53_1","volume-title":"Faster Unbalanced Private Set Intersection. In FC 2018 (LNCS","volume":"221","author":"Amanda","unstructured":"Amanda C. Davi Resende and Diego F. Aranha. 2018. Faster Unbalanced Private Set Intersection. In FC 2018 (LNCS, Vol. 10957), Sarah Meiklejohn and Kazue Sako (Eds.). Springer, Heidelberg, 203--221."},{"key":"e_1_3_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134044"},{"key":"e_1_3_2_2_55_1","unstructured":"Michael Scott. 2020. A note on the calculation of some functions in finite fields: Tricks of the Trade. Cryptology ePrint Archive Report 2020\/1497. https:\/\/eprint.iacr.org\/2020\/1497 ."},{"key":"e_1_3_2_2_56_1","volume-title":"NTL: A Library for doing Number Theory (11.4.3). https:\/\/libntl.org\/.","author":"Shoup Victor","year":"2021","unstructured":"Victor Shoup. 2021. NTL: A Library for doing Number Theory (11.4.3). https:\/\/libntl.org\/."},{"key":"e_1_3_2_2_57_1","volume-title":"Fully homomorphic SIMD operations. Designs, codes and cryptography","author":"Smart Nigel P","year":"2014","unstructured":"Nigel P Smart and Frederik Vercauteren. 2014. Fully homomorphic SIMD operations. Designs, codes and cryptography, Vol. 71, 1 (2014), 57--81."},{"key":"e_1_3_2_2_58_1","volume-title":"Epione: Lightweight contact tracing with strong privacy.","author":"Trieu Ni","year":"2020","unstructured":"Ni Trieu, Kareem Shehata, Prateek Saxena, Reza Shokri, and Dawn Song. 2020. Epione: Lightweight contact tracing with strong privacy."},{"key":"e_1_3_2_2_59_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.25"}],"event":{"name":"CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security","location":"Virtual Event Republic of Korea","acronym":"CCS '21","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3460120.3484760","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3460120.3484760","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3460120.3484760","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T20:49:58Z","timestamp":1763498998000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3460120.3484760"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,12]]},"references-count":59,"alternative-id":["10.1145\/3460120.3484760","10.1145\/3460120"],"URL":"https:\/\/doi.org\/10.1145\/3460120.3484760","relation":{},"subject":[],"published":{"date-parts":[[2021,11,12]]},"assertion":[{"value":"2021-11-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}