{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T18:35:23Z","timestamp":1772908523701,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,12,7]],"date-time":"2020-12-07T00:00:00Z","timestamp":1607299200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,12,7]]},"DOI":"10.1145\/3427228.3427267","type":"proceedings-article","created":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T22:20:18Z","timestamp":1607552418000},"page":"772-783","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["Practical Over-Threshold Multi-Party Private Set Intersection"],"prefix":"10.1145","author":[{"given":"Rasoul Akhavan","family":"Mahdavi","sequence":"first","affiliation":[{"name":"University of Waterloo"}]},{"given":"Thomas","family":"Humphries","sequence":"additional","affiliation":[{"name":"University of Waterloo"}]},{"given":"Bailey","family":"Kacsmar","sequence":"additional","affiliation":[{"name":"University of Waterloo, Canada"}]},{"given":"Simeon","family":"Krastnikov","sequence":"additional","affiliation":[{"name":"University of Waterloo"}]},{"given":"Nils","family":"Lukas","sequence":"additional","affiliation":[{"name":"University of Waterloo, Germany"}]},{"given":"John A.","family":"Premkumar","sequence":"additional","affiliation":[{"name":"University of Waterloo"}]},{"given":"Masoumeh","family":"Shafieinejad","sequence":"additional","affiliation":[{"name":"University of Waterloo"}]},{"given":"Simon","family":"Oya","sequence":"additional","affiliation":[{"name":"University of Waterloo, Canada"}]},{"given":"Florian","family":"Kerschbaum","sequence":"additional","affiliation":[{"name":"University of Waterloo, Canada"}]},{"given":"Erik-Oliver","family":"Blass","sequence":"additional","affiliation":[{"name":"Airbus, Germany"}]}],"member":"320","published-online":{"date-parts":[[2020,12,8]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Abdelrahaman Aly Marcel Keller Dragos Rotaru Peter Scholl Nigel P.Smart and Tim Wood. 2020. SCALE\u2013MAMBA software. https:\/\/homes.esat.kuleuven.be\/~nsmart\/SCALE\/.  Abdelrahaman Aly Marcel Keller Dragos Rotaru Peter Scholl Nigel P.Smart and Tim Wood. 2020. SCALE\u2013MAMBA software. https:\/\/homes.esat.kuleuven.be\/~nsmart\/SCALE\/."},{"key":"e_1_3_2_1_3_1","volume-title":"Recommendation for key management: Part 1: General","author":"Barker Elaine","unstructured":"Elaine Barker , William Barker , William Burr , William Polk , Miles Smid , 2006. Recommendation for key management: Part 1: General . National Institute of Standards and Technology , Technology Administration . Elaine Barker, William Barker, William Burr, William Polk, Miles Smid, 2006. Recommendation for key management: Part 1: General. National Institute of Standards and Technology, Technology Administration."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2663876.2663883"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.E95.A.1366"},{"key":"e_1_3_2_1_6_1","volume-title":"Efficient Conversion of Secret-shared Values Between Different Fields.IACR Cryptology ePrint Archive 2008 (01","author":"Damg\u00e5rd Ivan","year":"2008","unstructured":"Ivan Damg\u00e5rd and Rune Thorbek . 2008. Efficient Conversion of Secret-shared Values Between Different Fields.IACR Cryptology ePrint Archive 2008 (01 2008 ), 221. Ivan Damg\u00e5rd and Rune Thorbek. 2008. Efficient Conversion of Secret-shared Values Between Different Fields.IACR Cryptology ePrint Archive 2008 (01 2008), 221."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14577-3_13"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-014-9190-0"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24676-3_1"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-54365-8_8"},{"key":"e_1_3_2_1_11_1","volume-title":"Proceedings of the 19th Annual Network and Distributed System Security Symposium.","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 Proceedings of the 19th Annual Network and Distributed System Security Symposium. Yan Huang, David Evans, and Jonathan Katz. 2012. Private Set Intersection: Are Garbled Circuits Better than Custom Protocols?. In Proceedings of the 19th Annual Network and Distributed System Security Symposium."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/336992.337012"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2014.99"},{"key":"e_1_3_2_1_16_1","volume-title":"Advances in Cryptology \u2013 CRYPTO","author":"Kissner Lea","unstructured":"Lea Kissner and Dawn Song . 2005. Privacy-Preserving Set Operations . In Advances in Cryptology \u2013 CRYPTO , Victor Shoup (Ed.). Springer Berlin Heidelberg , Berlin, Heidelberg , 241\u2013257. Lea Kissner and Dawn Song. 2005. Privacy-Preserving Set Operations. In Advances in Cryptology \u2013 CRYPTO, Victor Shoup (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 241\u2013257."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978381"},{"key":"e_1_3_2_1_18_1","first-page":"681","article-title":"Are IP Addresses \u201cPersonally Identifiable Information","volume":"4","author":"Lah Frederick","year":"2008","unstructured":"Frederick Lah . 2008 . Are IP Addresses \u201cPersonally Identifiable Information \u201d? I\/S: A Journal of Law and Policy for the Information Society 4 (2008), 681 \u2013 707 . Issue 3. Frederick Lah. 2008. Are IP Addresses \u201cPersonally Identifiable Information\u201d?I\/S: A Journal of Law and Policy for the Information Society 4 (2008), 681\u2013707. Issue 3.","journal-title":"I\/S: A Journal of Law and Policy for the Information Society"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-019-09322-2"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53641-4_21"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.1986.10022"},{"key":"e_1_3_2_1_22_1","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201999","author":"Paillier Pascal","unstructured":"Pascal Paillier . 1999. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes . In Advances in Cryptology \u2014 EUROCRYPT \u201999 , Jacques Stern (Ed.). Springer Berlin Heidelberg , Berlin, Heidelberg , 223\u2013238. Pascal Paillier. 1999. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. In Advances in Cryptology \u2014 EUROCRYPT \u201999, Jacques Stern (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 223\u2013238."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26954-8_13"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3154794"},{"key":"e_1_3_2_1_25_1","volume-title":"How To Exchange Secrets with Oblivious Transfer.IACR Cryptology ePrint Archive 2005","author":"Rabin O","year":"2005","unstructured":"Michael\u00a0 O Rabin . 2005. How To Exchange Secrets with Oblivious Transfer.IACR Cryptology ePrint Archive 2005 ( 2005 ), 187. Michael\u00a0O Rabin. 2005. How To Exchange Secrets with Oblivious Transfer.IACR Cryptology ePrint Archive 2005 (2005), 187."},{"key":"e_1_3_2_1_26_1","unstructured":"David Ross Jason Shiffer Tony Dell William Gibb and Doug Wilson. 2020. OpenIOC. https:\/\/www.openioc.org\/.  David Ross Jason Shiffer Tony Dell William Gibb and Doug Wilson. 2020. OpenIOC. https:\/\/www.openioc.org\/."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2994539.2994542"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2812701"}],"event":{"name":"ACSAC '20: Annual Computer Security Applications Conference","location":"Austin USA","acronym":"ACSAC '20"},"container-title":["Annual Computer Security Applications Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3427228.3427267","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3427228.3427267","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:02:24Z","timestamp":1750197744000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3427228.3427267"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12,7]]},"references-count":26,"alternative-id":["10.1145\/3427228.3427267","10.1145\/3427228"],"URL":"https:\/\/doi.org\/10.1145\/3427228.3427267","relation":{},"subject":[],"published":{"date-parts":[[2020,12,7]]},"assertion":[{"value":"2020-12-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}