{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T07:36:14Z","timestamp":1772264174895,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,11,6]],"date-time":"2019-11-06T00:00:00Z","timestamp":1572998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Defense Advanced Research Projects Agency (DARPA) and Space and Naval Warfare Systems Center Pacific (SSC Pacific)","award":["N66001-15-C-4070"],"award-info":[{"award-number":["N66001-15-C-4070"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,11,6]]},"DOI":"10.1145\/3319535.3345661","type":"proceedings-article","created":{"date-parts":[[2019,11,7]],"date-time":"2019-11-07T13:08:32Z","timestamp":1573132112000},"page":"2403-2420","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":31,"title":["Two-party Private Set Intersection with an Untrusted Third Party"],"prefix":"10.1145","author":[{"given":"Phi Hung","family":"Le","sequence":"first","affiliation":[{"name":"George Mason University, Fairfax, VA, USA"}]},{"given":"Samuel","family":"Ranellucci","sequence":"additional","affiliation":[{"name":"Unbound Tech, Petach Tikva, Israel"}]},{"given":"S. Dov","family":"Gordon","sequence":"additional","affiliation":[{"name":"George Mason University, Fairfax, VA, USA"}]}],"member":"320","published-online":{"date-parts":[[2019,11,6]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2017.15"},{"key":"e_1_3_2_2_2_1","first-page":"805","volume-title":"High-throughput semi-honest secure three-party computation with an honest majority","author":"Araki Toshinori","year":"2016","unstructured":"Toshinori Araki , Jun Furukawa , Yehuda Lindell , Ariel Nof , and Kazuma Ohara . High-throughput semi-honest secure three-party computation with an honest majority . In Edgar R. Weippl, Stefan Katzenbeisser, Christopher Kruegel, Andrew C. Myers, and Shai Halevi, editors, ACM CCS 16, pages 805 -- 817 . ACM Press , October 2016 . Toshinori Araki, Jun Furukawa, Yehuda Lindell, Ariel Nof, and Kazuma Ohara. High-throughput semi-honest secure three-party computation with an honest majority. In Edgar R. Weippl, Stefan Katzenbeisser, Christopher Kruegel, Andrew C. Myers, and Shai Halevi, editors, ACM CCS 16, pages 805--817. ACM Press, October 2016."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(74)80029-2"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243836"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"crossref","unstructured":"Koji\n      Chida Daniel\n      Genkin Koki\n      Hamada Dai\n      Ikarashi Ryo\n      Kikuchi Yehuda\n      Lindell and \n      Ariel\n      Nof\n    .\n  Fast large-scale honest-majority MPC for malicious adversaries\n  . In Hovav Shacham and Alexandra Boldyreva editors CRYPTO \n  2018 Part III volume \n  10993\n   of \n  LNCS pages \n  34\n  --\n  64\n  . \n  Springer Heidelberg August 2018.  Koji Chida Daniel Genkin Koki Hamada Dai Ikarashi Ryo Kikuchi Yehuda Lindell and Ariel Nof. Fast large-scale honest-majority MPC for malicious adversaries. In Hovav Shacham and Alexandra Boldyreva editors CRYPTO 2018 Part III volume 10993 of LNCS pages 34--64. Springer Heidelberg August 2018.","DOI":"10.1007\/978-3-319-96878-0_2"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"crossref","unstructured":"Seung Geol\n      Choi Jonathan\n      Katz Alex J.\n      Malozemoff and \n      Vassilis\n      Zikas\n    .\n  Efficient three-party computation from cut-and-choose\n  . In Juan A. Garay and Rosario Gennaro editors CRYPTO \n  2014 Part II volume \n  8617\n   of \n  LNCS pages \n  513\n  --\n  530\n  . \n  Springer Heidelberg August 2014.  Seung Geol Choi Jonathan Katz Alex J. Malozemoff and Vassilis Zikas. Efficient three-party computation from cut-and-choose. In Juan A. Garay and Rosario Gennaro editors CRYPTO 2014 Part II volume 8617 of LNCS pages 513--530. Springer Heidelberg August 2014.","DOI":"10.1007\/978-3-662-44381-1_29"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-98113-0_25"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"crossref","unstructured":"Emiliano De\n      Cristofaro Paolo\n      Gasti and \n      Gene\n      Tsudik\n    .\n  Fast and private computation of cardinality of set intersection and union\n  . In Josef Pieprzyk Ahmad-Reza Sadeghi and Mark Manulis editors CANS 12 volume \n  7712\n   of \n  LNCS pages \n  218\n  -- \n  231\n  . \n  Springer Heidelberg December \n  2012\n  .  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_2_10_1","doi-asserted-by":"crossref","unstructured":"Bernardo Machado\n      David Ryo\n      Nishimaki Samuel\n      Ranellucci and \n      Alain\n      Tapp\n    .\n  Generalizing efficient multiparty computation\n  . In Anja Lehmann and Stefan Wolf editors ICITS 15 volume \n  9063\n   of \n  LNCS pages \n  15\n  --\n  32\n  . \n  Springer Heidelberg May \n  2015\n  .  Bernardo Machado David Ryo Nishimaki Samuel Ranellucci and Alain Tapp. Generalizing efficient multiparty computation. In Anja Lehmann and Stefan Wolf editors ICITS 15 volume 9063 of LNCS pages 15--32. Springer Heidelberg May 2015.","DOI":"10.1007\/978-3-319-17470-9_2"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"crossref","unstructured":"Alex\n      Davidson\n     and \n      Carlos\n      Cid\n    .\n  An efficient toolkit for computing private set operations\n  . In Josef Pieprzyk and Suriadi Suriadi editors ACISP 17 Part II volume \n  10343\n   of \n  LNCS pages \n  261\n  --\n  278\n  . \n  Springer Heidelberg July \n  2017\n  .  Alex Davidson and Carlos Cid. An efficient toolkit for computing private set operations. In Josef Pieprzyk and Suriadi Suriadi editors ACISP 17 Part II volume 10343 of LNCS pages 261--278. Springer Heidelberg July 2017.","DOI":"10.1007\/978-3-319-59870-3_15"},{"key":"e_1_3_2_2_12_1","first-page":"789","volume-title":"When private set intersection meets big data: an efficient and scalable protocol","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 13, pages 789 -- 800 . ACM Press , November 2013 . 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 13, pages 789--800. ACM Press, November 2013."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"crossref","unstructured":"Sky\n      Faber Stanislaw\n      Jarecki Sotirios\n      Kentros and \n      Boyang\n      Wei\n    .\n  Three-party ORAM for secure computation\n  . In Tetsu Iwata and Jung Hee Cheon editors ASIACRYPT \n  2015 Part I volume \n  9452\n   of \n  LNCS pages \n  360\n  --\n  385\n  . \n  Springer Heidelberg November \/ December 2015.  Sky Faber Stanislaw Jarecki Sotirios Kentros and Boyang Wei. Three-party ORAM for secure computation. In Tetsu Iwata and Jung Hee Cheon editors ASIACRYPT 2015 Part I volume 9452 of LNCS pages 360--385. Springer Heidelberg November \/ December 2015.","DOI":"10.1007\/978-3-662-48797-6_16"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"crossref","unstructured":"Michael J.\n      Freedman Kobbi\n      Nissim and \n      Benny\n      Pinkas\n    .\n  Efficient private matching and set intersection\n  . In Christian Cachin and Jan Camenisch editors EUROCRYPT \n  2004 volume \n  3027\n   of \n  LNCS pages \n  1\n  --\n  19\n  . \n  Springer Heidelberg May 2004.  Michael J. Freedman Kobbi Nissim and Benny Pinkas. Efficient private matching and set intersection. In Christian Cachin and Jan Camenisch editors EUROCRYPT 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_2_16_1","doi-asserted-by":"crossref","unstructured":"Jun\n      Furukawa Yehuda\n      Lindell Ariel\n      Nof and \n      Or\n      Weinstein\n    .\n  High-throughput secure three-party computation for malicious adversaries and an honest majority\n  . In Jean-S\u00e9bastien Coron and Jesper Buus Nielsen editors EUROCRYPT \n  2017 Part II volume \n  10211\n   of \n  LNCS pages \n  225\n  --\n  255\n  . \n  Springer Heidelberg April \/ May 2017.  Jun Furukawa Yehuda Lindell Ariel Nof and Or Weinstein. High-throughput secure three-party computation for malicious adversaries and an honest majority. In Jean-S\u00e9bastien Coron and Jesper Buus Nielsen editors EUROCRYPT 2017 Part II volume 10211 of LNCS pages 225--255. Springer Heidelberg April \/ May 2017.","DOI":"10.1007\/978-3-319-56614-6_8"},{"key":"e_1_3_2_2_17_1","volume-title":"Foundations of Cryptography","author":"Goldreich Oded","year":"2009","unstructured":"Oded Goldreich . Foundations of Cryptography : Volume 2 , Basic Applications, volume 2. Cambridge University Press , 2009 . Oded Goldreich. Foundations of Cryptography: Volume 2, Basic Applications, volume 2. Cambridge University Press, 2009."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382251"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-03332-3_3"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"crossref","unstructured":"Carmit\n      Hazay\n     and \n      Muthuramakrishnan\n      Venkitasubramaniam\n    .\n  Scalable multiparty private set-intersection\n  . In Serge Fehr editor PKC \n  2017 Part I volume \n  10174\n   of \n  LNCS pages \n  175\n  --\n  203\n  . \n  Springer Heidelberg March 2017.  Carmit Hazay and Muthuramakrishnan Venkitasubramaniam. Scalable multiparty private set-intersection. In Serge Fehr editor PKC 2017 Part I volume 10174 of LNCS pages 175--203. Springer Heidelberg March 2017.","DOI":"10.1007\/978-3-662-54365-8_8"},{"key":"e_1_3_2_2_22_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 . 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_2_25_1","doi-asserted-by":"crossref","unstructured":"Stanislaw\n      Jarecki\n     and \n      Boyang\n      Wei\n    .\n  3PC ORAM with low latency low bandwidth and fast batch retrieval\n  . In Bart Preneel and Frederik Vercauteren editors ACNS 18 volume \n  10892\n   of \n  LNCS pages \n  360\n  --\n  378\n  . \n  Springer Heidelberg July \n  2018\n  .  Stanislaw Jarecki and Boyang Wei. 3PC ORAM with low latency low bandwidth and fast batch retrieval. In Bart Preneel and Frederik Vercauteren editors ACNS 18 volume 10892 of LNCS pages 360--378. Springer Heidelberg July 2018.","DOI":"10.1007\/978-3-319-93387-0_19"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"crossref","unstructured":"Seny\n      Kamara Payman\n      Mohassel Mariana\n      Raykova and \n      Seyed Saeed\n      Sadeghian\n    .\n  Scaling private set intersection to billion-element sets\n  . In Nicolas Christin and Reihaneh Safavi-Naini editors FC \n  2014 volume \n  8437\n   of \n  LNCS pages \n  195\n  --\n  215\n  . \n  Springer Heidelberg March 2014.  Seny Kamara Payman Mohassel Mariana Raykova and Seyed Saeed Sadeghian. Scaling private set intersection to billion-element sets. In Nicolas Christin and Reihaneh Safavi-Naini editors FC 2014 volume 8437 of LNCS pages 195--215. Springer Heidelberg March 2014.","DOI":"10.1007\/978-3-662-45472-5_13"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"crossref","unstructured":"Lea\n      Kissner\n     and \n      Dawn Xiaodong\n      Song\n    .\n  Privacy-preserving set operations\n  . In Victor Shoup editor CRYPTO \n  2005 volume \n  3621\n   of \n  LNCS pages \n  241\n  --\n  257\n  . \n  Springer Heidelberg August 2005.  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_2_28_1","first-page":"818","volume-title":"Efficient batched oblivious PRF with applications to private set intersection","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 16, pages 818 -- 829 . ACM Press , October 2016 . 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 16, pages 818--829. ACM Press, October 2016."},{"key":"e_1_3_2_2_29_1","first-page":"35","volume-title":"ACM CCS 18","author":"Mohassel Payman","year":"2018","unstructured":"Payman Mohassel and Peter Rindal . ABY3 : A mixed protocol framework for machine learning . In ACM CCS 18 , pages 35 -- 52 . ACM Press , 2018 . Payman Mohassel and Peter Rindal. ABY3: A mixed protocol framework for machine learning. In ACM CCS 18, pages 35--52. ACM Press, 2018."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813705"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/795663.796378"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17659-4_5"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"crossref","unstructured":"Benny\n      Pinkas Thomas\n      Schneider Christian\n      Weinert and \n      Udi\n      Wieder\n    .\n  Efficient circuit-based PSI via cuckoo hashing\n  . In Jesper Buus Nielsen and Vincent Rijmen editors EUROCRYPT \n  2018 Part III volume \n  10822\n   of \n  LNCS pages \n  125\n  --\n  157\n  . \n  Springer Heidelberg April \/ May 2018.  Benny Pinkas Thomas Schneider Christian Weinert and Udi Wieder. Efficient circuit-based PSI via cuckoo hashing. In Jesper Buus Nielsen and Vincent Rijmen editors EUROCRYPT 2018 Part III volume 10822 of LNCS pages 125--157. Springer Heidelberg April \/ May 2018.","DOI":"10.1007\/978-3-319-78372-7_5"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77444-0"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"crossref","unstructured":"Peter\n      Rindal\n     and \n      Mike\n      Rosulek\n    .\n  Improved private set intersection against malicious adversaries\n  . In Jean-S\u00e9bastien Coron and Jesper Buus Nielsen editors EUROCRYPT \n  2017 Part I volume \n  10210\n   of \n  LNCS pages \n  235\n  --\n  259\n  . \n  Springer Heidelberg April \/ May 2017.  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_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134044"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-010-9378-8"}],"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 2019 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3319535.3345661","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3319535.3345661","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:24:02Z","timestamp":1750202642000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3319535.3345661"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,6]]},"references-count":32,"alternative-id":["10.1145\/3319535.3345661","10.1145\/3319535"],"URL":"https:\/\/doi.org\/10.1145\/3319535.3345661","relation":{},"subject":[],"published":{"date-parts":[[2019,11,6]]},"assertion":[{"value":"2019-11-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}