{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T23:53:31Z","timestamp":1781913211110,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,9,23]],"date-time":"2022-09-23T00:00:00Z","timestamp":1663891200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Shandong Provincial Natural Science Foundation","award":["ZR202102190210"],"award-info":[{"award-number":["ZR202102190210"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62102212"],"award-info":[{"award-number":["62102212"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Qingdao's major independent innovation project","award":["21-1-2-21-XX"],"award-info":[{"award-number":["21-1-2-21-XX"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,9,23]]},"DOI":"10.1145\/3565291.3565346","type":"proceedings-article","created":{"date-parts":[[2022,12,16]],"date-time":"2022-12-16T14:40:43Z","timestamp":1671201643000},"page":"339-343","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["MLPSI: Multi-party Privacy Set Intersection with Linear Complexity"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2841-6203","authenticated-orcid":false,"given":"Benxin","family":"Yin","sequence":"first","affiliation":[{"name":"Qingdao University, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6930-1624","authenticated-orcid":false,"given":"Hansong","family":"Xu","sequence":"additional","affiliation":[{"name":"Qingdao University, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2841-1234","authenticated-orcid":false,"given":"Xinliang","family":"Li","sequence":"additional","affiliation":[{"name":"China Construction Investment Data Technology (Shandong) Co., Ltd, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4815-9566","authenticated-orcid":false,"given":"Jun","family":"Sun","sequence":"additional","affiliation":[{"name":"China Construction Investment Data Technology (Shandong) Co., Ltd, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8869-6863","authenticated-orcid":false,"given":"Hanlin","family":"Zhang","sequence":"additional","affiliation":[{"name":"Qingdao University, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,12,16]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-75248-4_13"},{"key":"e_1_3_2_1_2_1","volume-title":"Multiparty Cardinality Testing for Threshold Private Intersection. In IACR International Conference on Public-Key Cryptography. Springer, 32\u201360","author":"Branco Pedro","year":"2021","unstructured":"Pedro Branco , Nico D\u00f6ttling , and Sihang Pu . 2021 . Multiparty Cardinality Testing for Threshold Private Intersection. In IACR International Conference on Public-Key Cryptography. Springer, 32\u201360 . Pedro Branco, Nico D\u00f6ttling, and Sihang Pu. 2021. Multiparty Cardinality Testing for Threshold Private Intersection. In IACR International Conference on Public-Key Cryptography. Springer, 32\u201360."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1315245.1315307"},{"key":"e_1_3_2_1_4_1","volume-title":"Sruthi Sekar, and Akash Shah.","author":"Chandran Nishanth","year":"2021","unstructured":"Nishanth Chandran , Nishka Dasgupta , Divya Gupta , Sai Lakshmi\u00a0Bhavana Obbattu , Sruthi Sekar, and Akash Shah. 2021 . Efficient Linear Multiparty PSI and Extensions to Circuit\/Quorum PSI.IACR Cryptol. ePrint Arch . 2021 (2021), 172. Nishanth Chandran, Nishka Dasgupta, Divya Gupta, Sai Lakshmi\u00a0Bhavana Obbattu, Sruthi Sekar, and Akash Shah. 2021. Efficient Linear Multiparty PSI and Extensions to Circuit\/Quorum PSI.IACR Cryptol. ePrint Arch. 2021 (2021), 172."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134061"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.E95.A.1366"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17373-8_13"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14577-3_13"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1515\/popets-2018-0037"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516701"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30576-7_17"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24676-3_1"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26951-7_1"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13013-7_19"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-54365-8_8"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-98113-0_13"},{"key":"e_1_3_2_1_17_1","volume-title":"Private Intersection-Sum Protocol with Applications to Attributing Aggregate Ad Conversions.IACR Cryptol. ePrint Arch. 2017","author":"Ion Mihaela","year":"2017","unstructured":"Mihaela Ion , Ben Kreuter , Erhan Nergiz , Sarvar Patel , Shobhit Saxena , Karn Seth , David Shanahan , and Moti Yung . 2017. Private Intersection-Sum Protocol with Applications to Attributing Aggregate Ad Conversions.IACR Cryptol. ePrint Arch. 2017 ( 2017 ), 738. Mihaela Ion, Ben Kreuter, Erhan Nergiz, Sarvar Patel, Shobhit Saxena, Karn Seth, David Shanahan, and Moti Yung. 2017. Private Intersection-Sum Protocol with Applications to Attributing Aggregate Ad Conversions.IACR Cryptol. ePrint Arch. 2017 (2017), 738."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.21236\/ADA457144"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978381"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134065"},{"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":"RSA Conference. Springer, 381\u2013396","author":"Orr\u00f9 Michele","year":"2017","unstructured":"Michele Orr\u00f9 , Emmanuela Orsini , and Peter Scholl . 2017 . Actively secure 1-out-of-n OT extension with application to private set intersection. In Cryptographers\u2019 Track at the RSA Conference. Springer, 381\u2013396 . Michele Orr\u00f9, Emmanuela Orsini, and Peter Scholl. 2017. Actively secure 1-out-of-n OT extension with application to private set intersection. In Cryptographers\u2019 Track at the RSA Conference. Springer, 381\u2013396."},{"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","volume-title":"PSI from PaXoS: fast, malicious private set intersection. Advances in Cryptology\u2013EUROCRYPT 2020 12106","author":"Pinkas Benny","year":"2020","unstructured":"Benny Pinkas , Mike Rosulek , Ni Trieu , and Avishay Yanai . 2020. PSI from PaXoS: fast, malicious private set intersection. Advances in Cryptology\u2013EUROCRYPT 2020 12106 ( 2020 ), 739. Benny Pinkas, Mike Rosulek, Ni Trieu, and Avishay Yanai. 2020. PSI from PaXoS: fast, malicious private set intersection. Advances in Cryptology\u2013EUROCRYPT 2020 12106 (2020), 739."},{"key":"e_1_3_2_1_25_1","volume-title":"Phasing: Private set intersection using permutation-based hashing. In 24th {USENIX} Security Symposium ({USENIX} Security 15). 515\u2013530.","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). 515\u2013530. 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). 515\u2013530."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17659-4_5"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-78372-7_5"},{"key":"e_1_3_2_1_28_1","volume-title":"23rd {USENIX} Security Symposium ({USENIX} Security 14). 797\u2013812.","author":"Pinkas Benny","unstructured":"Benny Pinkas , Thomas Schneider , and Michael Zohner . 2014. Faster private set intersection based on {OT} extension . In 23rd {USENIX} Security Symposium ({USENIX} Security 14). 797\u2013812. Benny Pinkas, Thomas Schneider, and Michael Zohner. 2014. Faster private set intersection based on {OT} extension. In 23rd {USENIX} Security Symposium ({USENIX} Security 14). 797\u2013812."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3154794"},{"key":"e_1_3_2_1_30_1","volume-title":"International Conference on Financial Cryptography and Data Security. Springer, 203\u2013221","author":"C\u00a0Davi Resende Amanda","year":"2018","unstructured":"Amanda C\u00a0Davi Resende and Diego\u00a0 F Aranha . 2018 . Faster unbalanced private set intersection . In International Conference on Financial Cryptography and Data Security. Springer, 203\u2013221 . Amanda C\u00a0Davi Resende and Diego\u00a0F Aranha. 2018. Faster unbalanced private set intersection. In International Conference on Financial Cryptography and Data Security. Springer, 203\u2013221."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-56620-7_9"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134044"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/PDCAT.2007.73"},{"key":"e_1_3_2_1_34_1","volume-title":"Proceedings of the thirty-first Australasian conference on Computer science-Volume 74","author":"Sang Yingpeng","year":"2008","unstructured":"Yingpeng Sang and Hong Shen . 2008 . Privacy preserving set intersection based on bilinear groups . In Proceedings of the thirty-first Australasian conference on Computer science-Volume 74 . Citeseer, 47\u201354. Yingpeng Sang and Hong Shen. 2008. Privacy preserving set intersection based on bilinear groups. In Proceedings of the thirty-first Australasian conference on Computer science-Volume 74. Citeseer, 47\u201354."},{"key":"e_1_3_2_1_35_1","volume-title":"International Colloquium on Automata, Languages, and Programming","author":"Shamir Adi","unstructured":"Adi Shamir . 1980. On the power of commutativity in cryptography . In International Colloquium on Automata, Languages, and Programming . Springer , 582\u2013595. Adi Shamir. 1980. On the power of commutativity in cryptography. In International Colloquium on Automata, Languages, and Programming. Springer, 582\u2013595."}],"event":{"name":"ICBDT 2022: 2022 5th International Conference on Big Data Technologies","location":"Qingdao China","acronym":"ICBDT 2022"},"container-title":["Proceedings of the 5th International Conference on Big Data Technologies"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3565291.3565346","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3565291.3565346","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:12Z","timestamp":1750178232000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3565291.3565346"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,23]]},"references-count":35,"alternative-id":["10.1145\/3565291.3565346","10.1145\/3565291"],"URL":"https:\/\/doi.org\/10.1145\/3565291.3565346","relation":{},"subject":[],"published":{"date-parts":[[2022,9,23]]},"assertion":[{"value":"2022-12-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}