{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T13:12:16Z","timestamp":1775913136562,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":48,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,11,12]],"date-time":"2021-11-12T00:00:00Z","timestamp":1636675200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSF","award":["2031799, 2101052, 2115075"],"award-info":[{"award-number":["2031799, 2101052, 2115075"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,11,12]]},"DOI":"10.1145\/3460120.3484778","type":"proceedings-article","created":{"date-parts":[[2021,11,13]],"date-time":"2021-11-13T12:05:34Z","timestamp":1636805134000},"page":"1166-1181","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":62,"title":["Compact and Malicious Private Set Intersection for Small Sets"],"prefix":"10.1145","author":[{"given":"Mike","family":"Rosulek","sequence":"first","affiliation":[{"name":"Oregon State University, Corvallis, OR, USA"}]},{"given":"Ni","family":"Trieu","sequence":"additional","affiliation":[{"name":"Arizona State University, Tempe, AZ, USA"}]}],"member":"320","published-online":{"date-parts":[[2021,11,13]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"https:\/\/www.imperialviolet.org\/2013\/12\/25\/elligator.html."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Michel Abdalla Mihir Bellare and Phillip Rogaway. The oracle Diffie-Hellman assumptions and an analysis of DHIES. In David Naccache editor CT-RSA 2001 volume 2020 of LNCS pages 143--158. Springer Heidelberg April 2001.","DOI":"10.1007\/3-540-45353-9_12"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Giuseppe Ateniese Emiliano De Cristofaro and Gene Tsudik. (If) size matters: Size-hiding private set intersection. In Dario Catalano Nelly Fazio Rosario Gennaro and Antonio Nicolosi editors PKC 2011 volume 6571 of LNCS pages 156--173. Springer Heidelberg March 2011.","DOI":"10.1007\/978-3-642-19379-8_10"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237996"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.39"},{"key":"e_1_3_2_1_6_1","first-page":"967","volume-title":"ACM CCS 2013","author":"Bernstein Daniel J.","year":"2013","unstructured":"Daniel J. Bernstein, Mike Hamburg, Anna Krasnova, and Tanja Lange. Elligator: elliptic-curve points indistinguishable from uniform random strings. In Ahmad- Reza Sadeghi, Virgil D. Gligor, and Moti Yung, editors, ACM CCS 2013, pages 967--980. ACM Press, November 2013."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Guido Bertoni Joan Daemen Micha\u00ebl Peeters and Gilles Van Assche. On the indifferentiability of the sponge construction. In Nigel P. Smart editor EURO- CRYPT 2008 volume 4965 of LNCS pages 181--197. Springer Heidelberg April 2008.","DOI":"10.1007\/978-3-540-78967-3_11"},{"key":"e_1_3_2_1_8_1","first-page":"291","volume-title":"ACM CCS 2019","author":"Boyle Elette","year":"2019","unstructured":"Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Peter Rindal, and Peter Scholl. Efficient two-round OT extension and silent non-interactive secure computation. In Lorenzo Cavallaro, Johannes Kinder, XiaoFeng Wang, and Jonathan Katz, editors, ACM CCS 2019, pages 291--308. ACM Press, November 2019."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-44618-9_24"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1007\/978-3-319-93387-0_15","volume-title":"Applied Cryptography and Network Security","author":"Cerulli Andrea","year":"2018","unstructured":"Andrea Cerulli, Emiliano De Cristofaro, and Claudio Soriente. Nothing refreshes like a repsi: Reactive private set intersection. In Bart Preneel and Frederik Vercauteren, editors, Applied Cryptography and Network Security, pages 280--300, Cham, 2018. Springer International Publishing."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Melissa Chase and Peihan Miao. Private set intersection in the internet setting from lightweight oblivious PRF. In Daniele Micciancio and Thomas Ristenpart editors CRYPTO 2020 Part III volume 12172 of LNCS pages 34--63. Springer Heidelberg August 2020.","DOI":"10.1007\/978-3-030-56877-1_2"},{"key":"e_1_3_2_1_12_1","first-page":"1223","volume-title":"ACM CCS 2018","author":"Chen Hao","year":"2018","unstructured":"Hao Chen, Zhicong Huang, Kim Laine, and Peter Rindal. Labeled PSI from fully homomorphic encryption with malicious security. In David Lie, Mohammad Mannan, Michael Backes, and XiaoFeng Wang, editors, ACM CCS 2018, pages 1223--1237. ACM Press, October 2018."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Chongwon Cho Dana Dachman-Soled and Stanislaw Jarecki. Efficient concurrent covert computation of string equality and set intersection. In Kazue Sako editor CT-RSA 2016 volume 9610 of LNCS pages 164--179. Springer Heidelberg February \/ March 2016.","DOI":"10.1007\/978-3-319-29485-8_10"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Dana Dachman-Soled Tal Malkin Mariana Raykova and Moti Yung. Efficient robust private set intersection. In Michel Abdalla David Pointcheval Pierre-Alain Fouque and Damien Vergnaud editors ACNS 09 volume 5536 of LNCS pages 125--142. Springer Heidelberg June 2009.","DOI":"10.1007\/978-3-642-01957-9_8"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Emiliano De Cristofaro Paolo Gasti and Gene Tsudik. Fast and private computation of cardinality of set intersection and union. In Josef Pieprzyk Ahmad-Reza Sadeghi and Mark Manulis editors CANS 12 volume 7712 of LNCS pages 218--231. Springer Heidelberg December 2012.","DOI":"10.1007\/978-3-642-35404-5_17"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Emiliano De Cristofaro Jihye Kim and Gene Tsudik. Linear-complexity private set intersection protocols secure in malicious model. In Masayuki Abe editor ASIACRYPT 2010 volume 6477 of LNCS pages 213--231. Springer Heidelberg December 2010.","DOI":"10.1007\/978-3-642-17373-8_13"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Emiliano De Cristofaro and Gene Tsudik. Practical private set intersection protocols with linear complexity. In Radu Sion editor FC 2010 volume 6052 of LNCS pages 143--159. Springer Heidelberg January 2010.","DOI":"10.1007\/978-3-642-14577-3_13"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Sumit Kumar Debnath and Ratna Dutta. Secure and efficient private set intersection cardinality using bloom filter. In Javier Lopez and Chris J. Mitchell editors ISC 2015 volume 9290 of LNCS pages 209--226. Springer Heidelberg September 2015.","DOI":"10.1007\/978-3-319-23318-5_12"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1515\/popets-2018-0037"},{"key":"e_1_3_2_1_20_1","first-page":"789","volume-title":"ACM CCS 2013","author":"Dong Changyu","year":"2013","unstructured":"Changyu Dong, Liqun Chen, and Zikai Wen. When private set intersection meets big data: an efficient and scalable protocol. In Ahmad-Reza Sadeghi, Virgil D. Gligor, and Moti Yung, editors, ACM CCS 2013, pages 789--800. ACM Press, November 2013."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"Michael J. Freedman Kobbi Nissim and Benny Pinkas. Efficient private matching and set intersection. In Christian Cachin and Jan Camenisch editors EURO- CRYPT 2004 volume 3027 of LNCS pages 1--19. Springer Heidelberg May 2004.","DOI":"10.1007\/978-3-540-24676-3_1"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Daniele Friolo Daniel Masny and Daniele Venturi. A black-box construction of fully-simulatable round-optimal oblivious transfer from strongly uniform key agreement. In Dennis Hofheinz and Alon Rosen editors TCC 2019 Part I volume 11891 of LNCS pages 111--130. Springer Heidelberg December 2019.","DOI":"10.1007\/978-3-030-36030-6_5"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Gayathri Garimella Benny Pinkas Mike Rosulek Ni Trieu and Avishay Yanai. Oblivious key-value stores and amplification for private set intersection. In Tal Malkin and Chris Peikert editors CRYPTO 2021 Part II volume 12826 of LNCS pages 395--425 Virtual Event August 2021. Springer Heidelberg.","DOI":"10.1007\/978-3-030-84245-1_14"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP40000.2020.00016"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-017-9263-y"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","unstructured":"Carmit Hazay and Kobbi Nissim. Efficient set operations in the presence of malicious adversaries. In Phong Q. Nguyen and David Pointcheval editors PKC 2010 volume 6056 of LNCS pages 312--331. Springer Heidelberg May 2010.","DOI":"10.1007\/978-3-642-13013-7_19"},{"key":"e_1_3_2_1_27_1","volume-title":"30th {USENIX}Security Symposium ({USENIX}Security 21)","author":"Heinrich Alexander","year":"2021","unstructured":"Alexander Heinrich, Matthias Hollick, Thomas Schneider, Milan Stute, and Christian Weinert. Privatedrop: Practical privacy-preserving authentication for apple airdrop. In 30th {USENIX}Security Symposium ({USENIX}Security 21), 2021."},{"key":"e_1_3_2_1_28_1","volume-title":"NDSS 2012","author":"Huang Yan","year":"2012","unstructured":"Yan Huang, David Evans, and Jonathan Katz. Private set intersection: Are garbled circuits better than custom protocols? In NDSS 2012. The Internet Society, February 2012."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/336992.337012"},{"key":"e_1_3_2_1_30_1","unstructured":"Mihaela Ion Ben Kreuter Ahmet Erhan Nergiz Sarvar Patel Mariana Raykova Shobhit Saxena Karn Seth David Shanahan and Moti Yung. On deploying secure computing commercially: Private intersection-sum protocols and their business applications. Cryptology ePrint Archive Report 2019\/723 2019. https:\/\/eprint.iacr.org\/2019\/723."},{"key":"e_1_3_2_1_31_1","unstructured":"Mihaela Ion Ben Kreuter Erhan Nergiz Sarvar Patel Shobhit Saxena Karn Seth David Shanahan and Moti Yung. Private intersection-sum protocol with applications to attributing aggregate ad conversions. Cryptology ePrint Archive Report 2017\/738 2017. https:\/\/eprint.iacr.org\/2017\/738."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","unstructured":"Yuval Ishai Joe Kilian Kobbi Nissim and Erez Petrank. Extending oblivious transfers efficiently. In Dan Boneh editor CRYPTO 2003 volume 2729 of LNCS pages 145--161. Springer Heidelberg August 2003.","DOI":"10.1007\/978-3-540-45146-4_9"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"crossref","unstructured":"Stanislaw Jarecki and Xiaomin Liu. Efficient oblivious pseudorandom function with applications to adaptive OT and secure computation of set intersection. In Omer Reingold editor TCC 2009 volume 5444 of LNCS pages 577--594. Springer Heidelberg March 2009.","DOI":"10.1007\/978-3-642-00457-5_34"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15317-4_26"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"crossref","unstructured":"Lea Kissner and Dawn Xiaodong Song. Privacy-preserving set operations. In Victor Shoup editor CRYPTO 2005 volume 3621 of LNCS pages 241--257. Springer Heidelberg August 2005.","DOI":"10.1007\/11535218_15"},{"key":"e_1_3_2_1_36_1","first-page":"818","volume-title":"ACM CCS 2016","author":"Kolesnikov Vladimir","year":"2016","unstructured":"Vladimir Kolesnikov, Ranjit Kumaresan, Mike Rosulek, and Ni Trieu. Efficient batched oblivious PRF with applications to private set intersection. In Edgar R. Weippl, Stefan Katzenbeisser, Christopher Kruegel, Andrew C. Myers, and Shai Halevi, editors, ACM CCS 2016, pages 818--829. ACM Press, October 2016."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"crossref","unstructured":"Mark Manulis Benny Pinkas and Bertram Poettering. Privacy-preserving group discovery with linear complexity. In Jianying Zhou and Moti Yung editors ACNS 10 volume 6123 of LNCS pages 420--437. Springer Heidelberg June 2010.","DOI":"10.1007\/978-3-642-13708-2_25"},{"key":"e_1_3_2_1_38_1","first-page":"309","volume-title":"ACM CCS 2019","author":"Masny Daniel","year":"2019","unstructured":"Daniel Masny and Peter Rindal. Endemic oblivious transfer. In Lorenzo Cavallaro, Johannes Kinder, XiaoFeng Wang, and Jonathan Katz, editors, ACM CCS 2019, pages 309--326. ACM Press, November 2019."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.1986.10022"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"crossref","unstructured":"Ghita Mezzour Adrian Perrig Virgil D. Gligor and Panos Papadimitratos. Privacy-preserving relationship path discovery in social networks. In Juan A. Garay Atsuko Miyaji and Akira Otsuka editors CANS 09 volume 5888 of LNCS pages 189--208. Springer Heidelberg December 2009.","DOI":"10.1007\/978-3-642-10433-6_13"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/SWAT.1972.5"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"crossref","unstructured":"Benny Pinkas Mike Rosulek Ni Trieu and Avishay Yanai. SpOT-light: Lightweight private set intersection from sparse OT extension. In Alexandra Boldyreva and Daniele Micciancio editors CRYPTO 2019 Part III volume 11694 of LNCS pages 401--431. Springer Heidelberg August 2019.","DOI":"10.1007\/978-3-030-26954-8_13"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"crossref","unstructured":"Benny Pinkas Mike Rosulek Ni Trieu and Avishay Yanai. PSI from PaXoS: Fast malicious private set intersection. In Anne Canteaut and Yuval Ishai editors EUROCRYPT 2020 Part II volume 12106 of LNCS pages 739--767. Springer Heidelberg May 2020.","DOI":"10.1007\/978-3-030-45724-2_25"},{"key":"e_1_3_2_1_44_1","first-page":"515","volume-title":"Phasing: Private set intersection using permutation-based hashing","author":"Pinkas Benny","year":"2015","unstructured":"Benny Pinkas, Thomas Schneider, Gil Segev, and Michael Zohner. Phasing: Private set intersection using permutation-based hashing. In Jaeyeon Jung and Thorsten Holz, editors, 24th USENIX Security Symposium, USENIX Security 15, Washington, D.C., USA, August 12--14, 2015., pages 515--530. USENIX Association, 2015."},{"key":"e_1_3_2_1_45_1","first-page":"797","volume-title":"Proceedings of the 23rd USENIX Security Symposium","author":"Pinkas Benny","year":"2014","unstructured":"Benny Pinkas, Thomas Schneider, and Michael Zohner. Faster private set inter- section based on OT extension. In Kevin Fu and Jaeyeon Jung, editors, Proceedings of the 23rd USENIX Security Symposium, San Diego, CA, USA, August 20--22, 2014., pages 797--812. USENIX Association, 2014."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"crossref","unstructured":"Peter Rindal and Mike Rosulek. Improved private set intersection against malicious adversaries. In Jean-S\u00e9bastien Coron and Jesper Buus Nielsen editors EUROCRYPT 2017 Part I volume 10210 of LNCS pages 235--259. Springer Heidelberg April \/ May 2017.","DOI":"10.1007\/978-3-319-56620-7_9"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134044"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"crossref","unstructured":"Peter Rindal and Phillipp Schoppmann. Vole-psi: Fast oprf and circuit-psi from vector-ole. Cryptology ePrint Archive Report 2021\/266 2021. https:\/\/eprint.iacr.org\/2021\/266.","DOI":"10.1007\/978-3-030-77886-6_31"}],"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.3484778","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3460120.3484778","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3460120.3484778","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T20:52:38Z","timestamp":1763499158000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3460120.3484778"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,12]]},"references-count":48,"alternative-id":["10.1145\/3460120.3484778","10.1145\/3460120"],"URL":"https:\/\/doi.org\/10.1145\/3460120.3484778","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"}}]}}