{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T14:57:11Z","timestamp":1773413831492,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":54,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,11,11]],"date-time":"2019-11-11T00:00:00Z","timestamp":1573430400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100006503","name":"Space and Naval Warfare Systems Command","doi-asserted-by":"publisher","award":["N66001-15-C-4065"],"award-info":[{"award-number":["N66001-15-C-4065"]}],"id":[{"id":"10.13039\/100006503","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007297","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-15-1-2750"],"award-info":[{"award-number":["N00014-15-1-2750"]}],"id":[{"id":"10.13039\/100007297","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1513671"],"award-info":[{"award-number":["CNS-1513671"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100011039","name":"Intelligence Advanced Research Projects Activity","doi-asserted-by":"publisher","award":["2019-1902070008"],"award-info":[{"award-number":["2019-1902070008"]}],"id":[{"id":"10.13039\/100011039","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100011038","name":"Office of the Director of National Intelligence","doi-asserted-by":"publisher","award":["2019-1902070008"],"award-info":[{"award-number":["2019-1902070008"]}],"id":[{"id":"10.13039\/100011038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["N66001-15-C-4065"],"award-info":[{"award-number":["N66001-15-C-4065"]}],"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":[[2019,11,11]]},"DOI":"10.1145\/3338498.3358645","type":"proceedings-article","created":{"date-parts":[[2019,11,11]],"date-time":"2019-11-11T18:15:00Z","timestamp":1573496100000},"page":"14-25","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["Private Set Intersection with Linear Communication from General Assumptions"],"prefix":"10.1145","author":[{"given":"Brett","family":"Hemenway Falk","sequence":"first","affiliation":[{"name":"University of Pennsylvania, Philadelphia, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Noble","sequence":"additional","affiliation":[{"name":"University of Pennsylvania, Philadelphia, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rafail","family":"Ostrovsky","sequence":"additional","affiliation":[{"name":"University of California, Los Angeles, Los Angeles, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,11,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Martin R Albrecht Christian Rechberger Thomas Schneider Tyge Tiessen and Michael Zohner. 2015. Ciphers for MPC and FHE. In EUROCRYPT. Springer 430--454.  Martin R Albrecht Christian Rechberger Thomas Schneider Tyge Tiessen and Michael Zohner. 2015. Ciphers for MPC and FHE. In EUROCRYPT. Springer 430--454.","DOI":"10.1007\/978-3-662-46800-5_17"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Yuriy Arbitman Moni Naor and Gil Segev. 2010. Backyard cuckoo hashing: Constant worst-case operations with a succinct representation. In FOCS. IEEE 787--796.  Yuriy Arbitman Moni Naor and Gil Segev. 2010. Backyard cuckoo hashing: Constant worst-case operations with a succinct representation. In FOCS. IEEE 787--796.","DOI":"10.1109\/FOCS.2010.80"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Elette Boyle Geoffroy Couteau Niv Gilboa Yuval Ishai Lisa Kohl and Peter Scholl. Efficient Pseudorandom Correlation Generators: Silent OT Extension and More. IACR ePrint 2019\/448. ( ????).  Elette Boyle Geoffroy Couteau Niv Gilboa Yuval Ishai Lisa Kohl and Peter Scholl. Efficient Pseudorandom Correlation Generators: Silent OT Extension and More. IACR ePrint 2019\/448. ( ????).","DOI":"10.1007\/978-3-030-26954-8_16"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Hao Chen Zhicong Huang Kim Laine and Peter Rindal. 2018. Labeled PSI from Fully Homomorphic Encryption with Malicious Security. In CCS. ACM 1223--1237.  Hao Chen Zhicong Huang Kim Laine and Peter Rindal. 2018. Labeled PSI from Fully Homomorphic Encryption with Malicious Security. In CCS. ACM 1223--1237.","DOI":"10.1145\/3243734.3243836"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Hao Chen Kim Laine and Peter Rindal. 2017. Fast Private Set Intersection from Homomorphic Encryption. In CCS. 1243--1255.  Hao Chen Kim Laine and Peter Rindal. 2017. Fast Private Set Intersection from Homomorphic Encryption. In CCS. 1243--1255.","DOI":"10.1145\/3133956.3134061"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Michele Ciampi and Claudio Orlandi. 2018. Combining Private Set-Intersection with Secure Two-Party Computation. In SCN .  Michele Ciampi and Claudio Orlandi. 2018. Combining Private Set-Intersection with Secure Two-Party Computation. In SCN .","DOI":"10.1007\/978-3-319-98113-0_25"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Claude Cr\u00e9peau. 1987. Equivalence between two flavours of oblivious transfers. In CRYPTO. 350--354.  Claude Cr\u00e9peau. 1987. Equivalence between two flavours of oblivious transfers. In CRYPTO. 350--354.","DOI":"10.1007\/3-540-48184-2_30"},{"key":"e_1_3_2_1_8_1","first-page":"122","article-title":"Single Database Private Information Retrieval Implies Oblivious Transfer","volume":"1807","author":"Crescenzo Giovanni D.","year":"2000","journal-title":"Eurocrypt"},{"key":"e_1_3_2_1_9_1","volume-title":"Applied Cryptography and Network Security","author":"Dachman-Soled Dana"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14577-3_13"},{"key":"e_1_3_2_1_11_1","first-page":"55","article-title":"Experimenting with Fast Private Set Intersection","volume":"7344","author":"Cristofaro Emiliano De","year":"2012","journal-title":"Trust"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Changyu Dong Liqun Chen and Zikai Wen. 2013. When private set intersection meets big data: an efficient and scalable protocol. In CCS . 789--800.  Changyu Dong Liqun Chen and Zikai Wen. 2013. When private set intersection meets big data: an efficient and scalable protocol. In CCS . 789--800.","DOI":"10.1145\/2508859.2516701"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3812.3818"},{"key":"e_1_3_2_1_14_1","unstructured":"FBI. 2019. National Crime Information Center (NCIC). https:\/\/www.fbi.gov\/services\/cjis\/ncic . (July 2019).  FBI. 2019. National Crime Information Center (NCIC). https:\/\/www.fbi.gov\/services\/cjis\/ncic . (July 2019)."},{"key":"e_1_3_2_1_15_1","first-page":"303","article-title":"Keyword Search and Oblivious Pseudorandom Functions","volume":"3378","author":"Freedman Michael J","year":"2005","journal-title":"TCC"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Michael J Freedman Kobbi Nissim and Benny Pinkas. 2004. Efficient private matching and set intersection. EUROCRYPT. 1--19.  Michael J Freedman Kobbi Nissim and Benny Pinkas. 2004. Efficient private matching and set intersection. EUROCRYPT. 1--19.","DOI":"10.1007\/978-3-540-24676-3_1"},{"key":"e_1_3_2_1_17_1","unstructured":"Yael Gertner Sampath Kannan Tal Malkin Omer Reingold and Mahesh Viswanathan. 2000. The relationship between public key encryption and oblivious transfer. In FOCS . 325.  Yael Gertner Sampath Kannan Tal Malkin Omer Reingold and Mahesh Viswanathan. 2000. The relationship between public key encryption and oblivious transfer. In FOCS . 325."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Oded Goldreich. 2001. Foundations of cryptography: volume 1 .Cambridge university press.  Oded Goldreich. 2001. Foundations of cryptography: volume 1 .Cambridge university press.","DOI":"10.1017\/CBO9780511546891"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Oded Goldreich. 2004. Foundations of cryptography: volume 2 .Cambridge university press.  Oded Goldreich. 2004. Foundations of cryptography: volume 2 .Cambridge university press.","DOI":"10.1017\/CBO9780511721656"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-008-9034-x"},{"key":"e_1_3_2_1_21_1","first-page":"312","article-title":"Efficient Set Operations in the Presence of Malicious Adversaries","volume":"6056","author":"Hazay Carmit","year":"2010","journal-title":"PKC"},{"key":"e_1_3_2_1_22_1","volume-title":"CRYPTO .","author":"Hofheinz Dennis","year":"2007"},{"key":"e_1_3_2_1_23_1","unstructured":"Yan Huang David Evans and Jonathan Katz. 2012. Private set intersection: Are garbled circuits better than custom protocols?. In NDSS .  Yan Huang David Evans and Jonathan Katz. 2012. Private set intersection: Are garbled circuits better than custom protocols?. In NDSS ."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"Russell Impagliazzo and Steven Rudich. 1989. Limits on the Provable Consequences of One-Way Permutations. In STOC. 44--61.  Russell Impagliazzo and Steven Rudich. 1989. Limits on the Provable Consequences of One-Way Permutations. In STOC. 44--61.","DOI":"10.1145\/73007.73012"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45146-4_9"},{"key":"e_1_3_2_1_26_1","first-page":"667","article-title":"Constant-Rate Oblivious Transfer from Noisy Channels . CRYPTO. Vol. 6841","volume":"38","author":"Ishai Yuval","year":"2011","journal-title":"Chapter"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"Yuval Ishai Manoj Prabhakaran and Amit Sahai. 2008. Founding Cryptography on Oblivious Transfer - Efficiently. In CRYPTO . 572--591.  Yuval Ishai Manoj Prabhakaran and Amit Sahai. 2008. Founding Cryptography on Oblivious Transfer - Efficiently. In CRYPTO . 572--591.","DOI":"10.1007\/978-3-540-85174-5_32"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00457-5_34"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","unstructured":"Stanis\u0142aw Jarecki and Xiaomin Liu. 2010. Fast secure computation of set intersection. Security and Cryptography for Networks (2010) 418--435.  Stanis\u0142aw Jarecki and Xiaomin Liu. 2010. Fast secure computation of set intersection. Security and Cryptography for Networks (2010) 418--435.","DOI":"10.1007\/978-3-642-15317-4_26"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"crossref","unstructured":"Yael T. Kalai. 2005. Smooth Projective Hashing and Two-Message Oblivious Transfer. In EUROCRYPT . 78--95. https:\/\/doi.org\/10.1007\/11426639_5  Yael T. Kalai. 2005. Smooth Projective Hashing and Two-Message Oblivious Transfer. In EUROCRYPT . 78--95. https:\/\/doi.org\/10.1007\/11426639_5","DOI":"10.1007\/11426639_5"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62215"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/1957995.1958011"},{"key":"e_1_3_2_1_33_1","first-page":"97","article-title":"Private set intersection for unequal set sizes with mobile applications","volume":"4","author":"Kiss \u00c1gnes","year":"2017","journal-title":"PoPETs"},{"key":"e_1_3_2_1_34_1","first-page":"241","article-title":"Privacy-preserving set operations","volume":"3621","author":"Kissner Lea","year":"2005","journal-title":"CRYPTO"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"crossref","unstructured":"Vladimir Kolesnikov Ranjit Kumaresan Mike Rosulek and Ni Trieu. 2016. Efficient batched oblivious PRF with applications to private set intersection. In CCS . 818--829.  Vladimir Kolesnikov Ranjit Kumaresan Mike Rosulek and Ni Trieu. 2016. Efficient batched oblivious PRF with applications to private set intersection. In CCS . 818--829.","DOI":"10.1145\/2976749.2978381"},{"key":"e_1_3_2_1_36_1","volume-title":"Combinatorics and Probabilities (DMTCS Proceedings), , Philippe Chassaing et almbox. (Eds.)","volume":"406","author":"Kutzelnigg Reinhard","year":"2006"},{"key":"e_1_3_2_1_37_1","unstructured":"Mikkel Lamb\u00e6k. 2016. Breaking and Fixing Private Set Intersection Protocols. IACR ePrint 2016\/665. (2016).  Mikkel Lamb\u00e6k. 2016. Breaking and Fixing Private Set Intersection Protocols. IACR ePrint 2016\/665. (2016)."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.56.1154"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"crossref","unstructured":"Michael Mitzenmacher. 2009. Some Open Questions Related to Cuckoo Hashing. In ESA. 1--10.  Michael Mitzenmacher. 2009. Some Open Questions Related to Cuckoo Hashing. In ESA. 1--10.","DOI":"10.1007\/978-3-642-04128-0_1"},{"key":"e_1_3_2_1_41_1","volume-title":"David Wagner (Ed.)","volume":"5157","author":"Peikert Chris","year":"2008"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"crossref","unstructured":"Benny Pinkas Mike Rosulek Ni Trieu and Avishay Yanai. 2019. SpOT-Light: Lightweight Private Set Intersection from Sparse OT Extension. (2019).  Benny Pinkas Mike Rosulek Ni Trieu and Avishay Yanai. 2019. SpOT-Light: Lightweight Private Set Intersection from Sparse OT Extension. (2019).","DOI":"10.1007\/978-3-030-26954-8_13"},{"key":"e_1_3_2_1_43_1","volume-title":"Phasing: Private Set Intersection Using Permutation-based Hashing. In USENIX Security Symposium. 515--530","author":"Pinkas Benny","year":"2015"},{"key":"e_1_3_2_1_44_1","first-page":"250","article-title":"Secure Two-Party Computation Is Practical","volume":"9","author":"Pinkas Benny","year":"2009","journal-title":"ASIACRYPT"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"crossref","unstructured":"Benny Pinkas Thomas Schneider Oleksandr Tkachenko and Avishay Yanai. 2019. Efficient Circuit-Based PSI with Linear Communication. In EUROCRYPTO . 122--153.  Benny Pinkas Thomas Schneider Oleksandr Tkachenko and Avishay Yanai. 2019. Efficient Circuit-Based PSI with Linear Communication. In EUROCRYPTO . 122--153.","DOI":"10.1007\/978-3-030-17659-4_5"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"crossref","unstructured":"Benny Pinkas Thomas Schneider Christian Weinert and Udi Wieder. 2018. Efficient Circuit-based PSI via Cuckoo Hashing. EUROCRYPT .  Benny Pinkas Thomas Schneider Christian Weinert and Udi Wieder. 2018. Efficient Circuit-based PSI via Cuckoo Hashing. EUROCRYPT .","DOI":"10.1007\/978-3-319-78372-7_5"},{"key":"e_1_3_2_1_47_1","unstructured":"Benny Pinkas Thomas Schneider and Michael Zohner. 2014. Faster Private Set Intersection Based on OT Extension. In USENIX. 797--812.  Benny Pinkas Thomas Schneider and Michael Zohner. 2014. Faster Private Set Intersection Based on OT Extension. In USENIX. 797--812."},{"key":"e_1_3_2_1_48_1","unstructured":"Benny Pinkas Thomas Schneider and Michael Zohner. 2016. Scalable Private Set Intersection Based on OT Extension. IACR Cryptology ePrint Archive. (2016).  Benny Pinkas Thomas Schneider and Michael Zohner. 2016. Scalable Private Set Intersection Based on OT Extension. IACR Cryptology ePrint Archive. (2016)."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-58387-6_11"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"crossref","unstructured":"Peter Rindal and Mike Rosulek. 2017. Improved private set intersection against malicious adversaries. In EUROCRYPT . 235--259.  Peter Rindal and Mike Rosulek. 2017. Improved private set intersection against malicious adversaries. In EUROCRYPT . 235--259.","DOI":"10.1007\/978-3-319-56620-7_9"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"crossref","unstructured":"Louis Salvail Christian Schaffner and Miroslava Sot\u00e1kov\u00e1. 2009. On the Power of Two-Party Quantum Cryptography. In ASIACRYPT. 70--87.  Louis Salvail Christian Schaffner and Miroslava Sot\u00e1kov\u00e1. 2009. On the Power of Two-Party Quantum Cryptography. In ASIACRYPT. 70--87.","DOI":"10.1007\/978-3-642-10366-7_5"},{"key":"e_1_3_2_1_53_1","volume-title":"Catching Bandits and Only Bandits: Privacy-Preserving Intersection Warrants for Lawful Surveillance. In 4th USENIX Workshop on Free and Open Communications on the Internet (FOCI 14)","author":"Segal Aaron","year":"2014"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/321439.321449"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14623-7_38"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"crossref","unstructured":"Stefan Wolf and J\u00fcrg Wullschleger. 2006. Oblivious transfer is symmetric. In EUROCRYPT. 222--232.  Stefan Wolf and J\u00fcrg Wullschleger. 2006. Oblivious transfer is symmetric. In EUROCRYPT. 222--232.","DOI":"10.1007\/11761679_14"}],"event":{"name":"CCS '19: 2019 ACM SIGSAC Conference on Computer and Communications Security","location":"London United Kingdom","acronym":"CCS '19","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 18th ACM Workshop on Privacy in the Electronic Society"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3338498.3358645","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3338498.3358645","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3338498.3358645","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:12:48Z","timestamp":1750201968000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3338498.3358645"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,11]]},"references-count":54,"alternative-id":["10.1145\/3338498.3358645","10.1145\/3338498"],"URL":"https:\/\/doi.org\/10.1145\/3338498.3358645","relation":{},"subject":[],"published":{"date-parts":[[2019,11,11]]},"assertion":[{"value":"2019-11-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}