{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T13:27:14Z","timestamp":1787059634654,"version":"build-2736575974"},"publisher-location":"New York, NY, USA","reference-count":80,"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"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,11,12]]},"DOI":"10.1145\/3460120.3484591","type":"proceedings-article","created":{"date-parts":[[2021,11,13]],"date-time":"2021-11-13T12:05:27Z","timestamp":1636805127000},"page":"1182-1204","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":61,"title":["Efficient Linear Multiparty PSI and Extensions to Circuit\/Quorum PSI"],"prefix":"10.1145","author":[{"given":"Nishanth","family":"Chandran","sequence":"first","affiliation":[{"name":"Microsoft Research, Bangalore, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nishka","family":"Dasgupta","sequence":"additional","affiliation":[{"name":"Aarhus University, Aarhus, Denmark"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Divya","family":"Gupta","sequence":"additional","affiliation":[{"name":"Microsoft Research, Bangalore, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sai Lakshmi Bhavana","family":"Obbattu","sequence":"additional","affiliation":[{"name":"Microsoft Research, Bangalore, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sruthi","family":"Sekar","sequence":"additional","affiliation":[{"name":"Indian Institute of Science, Bangalore, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Akash","family":"Shah","sequence":"additional","affiliation":[{"name":"University of California, Los Angeles, Los Angeles, CA, 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.1007\/978--3--319--18467--8_1"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978331"},{"key":"e_1_3_2_2_3_1","first-page":"600","article-title":"Multi-Party Threshold Private Set Intersection with Sublinear Communication","volume":"2020","author":"Badrinarayanan Saikrishna","year":"2020","unstructured":"Saikrishna Badrinarayanan, Peihan Miao, and Peter Rindal. 2020. Multi-Party Threshold Private Set Intersection with Sublinear Communication. IACR Cryptol. ePrint Arch., Vol. 2020 (2020), 600. https:\/\/eprint.iacr.org\/2020\/600","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100287"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62213"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/MARK.1979.8817296"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--540--88313--5_13"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--319--96884--1_19"},{"key":"e_1_3_2_2_9_1","first-page":"489","volume-title":"Efficient Pseudorandom Correlation Generators: Silent OT Extension and More. Advances in Cryptology-Crypto","author":"Boyle Elette","year":"2019","unstructured":"Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, and Peter Scholl. 2019. Efficient Pseudorandom Correlation Generators: Silent OT Extension and More. Advances in Cryptology-Crypto 2019, Part III, LNCS, pages 489--518. Springer,."},{"key":"e_1_3_2_2_10_1","first-page":"1307","article-title":"Multiparty Cardinality Testing for Threshold Private Set Intersection","volume":"2020","author":"Branco Pedro","year":"2020","unstructured":"Pedro Branco, Nico D\u00f6 ttling, and Sihang Pu. 2020. Multiparty Cardinality Testing for Threshold Private Set Intersection. IACR Cryptol. ePrint Arch., Vol. 2020 (2020), 1307. https:\/\/eprint.iacr.org\/2020\/1307","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959888"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--642--15317--4_13"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.2478\/popets-2022-0018"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3-030--56877--1_2"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.E95.A.1366"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--319--98113-0_25"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/3--540--45539--6_22"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--642--17373--8_13"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--642--14577--3_13"},{"key":"e_1_3_2_2_20_1","unstructured":"cryptobiu. 2019. MPCHonestMajority. https:\/\/github.com\/cryptobiu\/MPC-Benchmark\/tree\/master\/MPCHonestMajority. Accessed: 2020-08--31."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--540--74143--5_32"},{"key":"e_1_3_2_2_22_1","volume-title":"ABY - A Framework for Efficient Mixed-Protocol Secure Two-Party Computation. In 22nd Annual Network and Distributed System Security Symposium, NDSS 2015","author":"Demmler Daniel","year":"2015","unstructured":"Daniel Demmler, Thomas Schneider, and Michael Zohner. 2015. ABY - A Framework for Efficient Mixed-Protocol Secure Two-Party Computation. In 22nd Annual Network and Distributed System Security Symposium, NDSS 2015, San Diego, California, USA, February 8--11, 2015. The Internet Society. https:\/\/www.ndss-symposium.org\/ndss2015\/aby--framework-efficient-mixed-protocol-secure-two-party-computation"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2017.23097"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516701"},{"key":"e_1_3_2_2_25_1","unstructured":"encryptogroup. 2020. OPPRF-PSI. https:\/\/github.com\/encryptogroup\/OPPRF-PSI Accessed: 2020-08--31."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3338498.3358645"},{"key":"e_1_3_2_2_27_1","unstructured":"Financial Action Task Force. 2018a. Concealment of Beneficial Ownership. http:\/\/www.fatf-gafi.org\/media\/fatf\/documents\/reports\/FATF-Egmont-Concealment-beneficial-ownership.pdf ."},{"key":"e_1_3_2_2_28_1","unstructured":"Financial Action Task Force. 2018b. Professional Money Laundering. https:\/\/www.fatf-gafi.org\/media\/fatf\/documents\/Professional-Money-Laundering.pdf ."},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-014--9190-0"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--540--30576--7_17"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--540--24676--3_1"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--540--71677--8_22"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536440"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--642--40041--4_5"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3-030--17659--4_6"},{"key":"e_1_3_2_2_36_1","first-page":"175","article-title":"The Communication Complexity of Threshold Private Set Intersection","volume":"2019","author":"Ghosh Satrajit","year":"2019","unstructured":"Satrajit Ghosh and Mark Simkin. 2019. The Communication Complexity of Threshold Private Set Intersection. IACR Cryptol. ePrint Arch., Vol. 2019 (2019), 175. https:\/\/eprint.iacr.org\/2019\/175","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1984.715949"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28420"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28420"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--642--22012--8_46"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2017.24"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--642--13013--7_19"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--662--54365--8_8"},{"key":"e_1_3_2_2_45_1","volume-title":"19th Annual Network and Distributed System Security Symposium, NDSS, 2012","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 19th Annual Network and Distributed System Security Symposium, NDSS, 2012, San Diego, California, USA, February 5--8, 2012. The Internet Society. https:\/\/www.ndss-symposium.org\/ndss2012\/private-set-intersection-are-garbled-circuits-better-custom-protocols"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/336992.337012"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--319--98113-0_13"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/EuroSP48549.2020.00031"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1007\/11535218_15"},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978381"},{"key":"e_1_3_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134065"},{"key":"e_1_3_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133999"},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.1986.10022"},{"key":"e_1_3_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--319--25645-0_26"},{"key":"e_1_3_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243760"},{"key":"e_1_3_2_2_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3423358"},{"key":"e_1_3_2_2_57_1","unstructured":"mpc msri. 2020. EzPC. https:\/\/github.com\/mpc-msri\/EzPC Accessed: 2021-01--17."},{"key":"e_1_3_2_2_58_1","unstructured":"mpc msri. 2021. 2PC-Circuit-PSI. https:\/\/aka.ms\/2PC-Circuit-PSI"},{"key":"e_1_3_2_2_59_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--319--52153--4_22"},{"key":"e_1_3_2_2_60_1","unstructured":"osu crypto. 2020. MultipartyPSI. https:\/\/github.com\/osu-crypto\/MultipartyPSI. Accessed: 2020-06--30."},{"key":"e_1_3_2_2_61_1","doi-asserted-by":"publisher","DOI":"10.1007\/3--540--44676--1_10"},{"key":"e_1_3_2_2_62_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3-030--26954--8_13"},{"key":"e_1_3_2_2_63_1","doi-asserted-by":"publisher","unstructured":"Benny Pinkas Mike Rosulek Ni Trieu and Avishay Yanai. 2020. PSI from PaXoS: Fast Malicious Private Set Intersection. In Advances in Cryptology - EUROCRYPT 2020 - 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques Zagreb Croatia May 10--14 2020 Proceedings Part II (Lecture Notes in Computer Science Vol. 12106) Anne Canteaut and Yuval Ishai (Eds.). Springer 739--767. https:\/\/doi.org\/10.1007\/978--3-030--45724--2_25","DOI":"10.1007\/978--3-030--45724--2_25"},{"key":"e_1_3_2_2_64_1","volume-title":"Phasing: Private Set Intersection Using Permutation-based Hashing. In 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, Washington, D.C., USA, August 12--14, 2015, Jaeyeon Jung and Thorsten Holz (Eds.). USENIX Association, 515--530. https:\/\/www.usenix.org\/conference\/usenixsecurity15\/technical-sessions\/presentation\/pinkas"},{"key":"e_1_3_2_2_65_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3-030--17659--4_5"},{"key":"e_1_3_2_2_66_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--319--78372--7_5"},{"key":"e_1_3_2_2_67_1","doi-asserted-by":"publisher","DOI":"10.1145\/3154794"},{"key":"e_1_3_2_2_68_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417274"},{"key":"e_1_3_2_2_69_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--319--56620--7_9"},{"key":"e_1_3_2_2_70_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134044"},{"key":"e_1_3_2_2_71_1","doi-asserted-by":"publisher","DOI":"10.1109\/PDCAT.2007.59"},{"key":"e_1_3_2_2_72_1","volume-title":"Thirty-First Australasian Computer Science Conference (ACSC2008)","volume":"54","author":"Sang Yingpeng","year":"2008","unstructured":"Yingpeng Sang and Hong Shen. 2008. Privacy preserving set intersection based on bilinear groups. In Computer Science 2008, Thirty-First Australasian Computer Science Conference (ACSC2008), Wollongong, NSW, Australia, January 22--25, 2008 (CRPIT, Vol. 74), Gillian Dobbie and Bernard Mans (Eds.). Australian Computer Society, 47--54. https:\/\/dl.acm.org\/citation.cfm?id=1378290"},{"key":"e_1_3_2_2_73_1","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"e_1_3_2_2_74_1","doi-asserted-by":"publisher","DOI":"10.1007\/3--540--10003--2_100"},{"key":"e_1_3_2_2_75_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417276"},{"key":"e_1_3_2_2_76_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.25"},{"key":"e_1_3_2_2_77_1","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2812701"},{"key":"e_1_3_2_2_78_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516752"},{"key":"e_1_3_2_2_79_1","doi-asserted-by":"publisher","DOI":"10.1515\/popets-2017-0010"},{"key":"e_1_3_2_2_80_1","doi-asserted-by":"publisher","DOI":"10.1145\/3267323.3268965"}],"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.3484591","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3460120.3484591","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T20:45:56Z","timestamp":1763498756000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3460120.3484591"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,12]]},"references-count":80,"alternative-id":["10.1145\/3460120.3484591","10.1145\/3460120"],"URL":"https:\/\/doi.org\/10.1145\/3460120.3484591","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"}}]}}