{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T15:15:12Z","timestamp":1781018112591,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":41,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,11,21]],"date-time":"2023-11-21T00:00:00Z","timestamp":1700524800000},"content-version":"vor","delay-in-days":6,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1942400"],"award-info":[{"award-number":["1942400"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,11,15]]},"DOI":"10.1145\/3576915.3623158","type":"proceedings-article","created":{"date-parts":[[2023,11,21]],"date-time":"2023-11-21T12:35:13Z","timestamp":1700570113000},"page":"2188-2201","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["Efficient Multiparty Probabilistic Threshold Private Set Intersection"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4298-3925","authenticated-orcid":false,"given":"Feng-Hao","family":"Liu","sequence":"first","affiliation":[{"name":"Washington State University, Pullman, WA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4106-6877","authenticated-orcid":false,"given":"En","family":"Zhang","sequence":"additional","affiliation":[{"name":"Henan Normal University, Xinxiang, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4406-8106","authenticated-orcid":false,"given":"Leiyong","family":"Qin","sequence":"additional","affiliation":[{"name":"Henan Normal University, Xinxiang, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,11,21]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"93","volume-title":"ACM CCSW@CCS 2019?","author":"Zhang E.","unstructured":"E. Zhang, F. H. Liu, Q. Lai, G. Jin, Y. Li, Efficient multi-party private set intersection against malicious adversaries, in: ACM CCSW@CCS 2019? pp. 93--104."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-84245-1_14"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-56877-1_2"},{"key":"e_1_3_2_1_4_1","first-page":"2403","volume-title":"ACM CCS 2019","author":"Le P. H.","year":"2019","unstructured":"P. H. Le, S. Ranellucci, S. D. Gordon, Two-party private set intersection with an untrusted third party, in: L. Cavallaro, J. Kinder, X. Wang, J. Katz (Eds.), ACM CCS 2019, ACM Press, 2019, pp. 2403--2420."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-77886-6_31"},{"key":"e_1_3_2_1_6_1","series-title":"LNCS","first-page":"195","volume-title":"N","author":"Kamara S.","year":"2014","unstructured":"S. Kamara, P. Mohassel, M. Raykova, S. S. Sadeghian, Scaling private set intersection to billion-element sets, in: N. Christin, R. Safavi-Naini (Eds.), FC 2014, volume 8437 of LNCS, Springer, Heidelberg, 2014, pp. 195--215."},{"key":"e_1_3_2_1_7_1","first-page":"818","volume-title":"ACM CCS 2016","author":"Kolesnikov V.","year":"2016","unstructured":"V. Kolesnikov, R. Kumaresan, M. Rosulek, N. Trieu, Efficient batched oblivious PRF with applications to private set intersection, in: E. R. Weippl, S. Katzenbeisser, C. Kruegel, A. C. Myers, S. Halevi (Eds.), ACM CCS 2016, ACM Press, 2016, pp. 818--829."},{"key":"e_1_3_2_1_8_1","first-page":"1257","volume-title":"ACM CCS 2017","author":"Kolesnikov V.","year":"2017","unstructured":"V. Kolesnikov, N. Matania, B. Pinkas, M. Rosulek, N. Trieu, Practical multi-party private set intersection from symmetric-key techniques, in: B. M. Thuraisingham, D. Evans, T. Malkin, D. Xu (Eds.), ACM CCS 2017, ACM Press, 2017, pp. 1257--1272."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"S. K. Debnath R. Dutta Towards fair mutual private set intersection with linear complexity Security and Communication Networks 9 (2016) 1589--1612.","DOI":"10.1002\/sec.1450"},{"key":"e_1_3_2_1_10_1","volume-title":"Efficient delegated private set intersection on outsourced private datasets","author":"Abadi A.","year":"2017","unstructured":"A. Abadi, S. Terzis, R. Metere, C. Dong, Efficient delegated private set intersection on outsourced private datasets, IEEE Transactions on Dependable and Secure Computing (2017) 1--15."},{"key":"e_1_3_2_1_11_1","first-page":"789","volume-title":"ACM CCS 2013","author":"Dong C.","year":"2013","unstructured":"C. Dong, L. Chen, Z. Wen, When private set intersection meets big data: an efficient and scalable protocol, in: A.-R. Sadeghi, V. D. Gligor, M. Yung (Eds.), ACM CCS 2013, ACM Press, 2013, pp. 789--800."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-56620-7_9"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45724-2_25"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484772"},{"key":"e_1_3_2_1_15_1","volume-title":"Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security,CCS 2021","author":"Rosulek M.","year":"2021","unstructured":"M. Rosulek, N. Trieu, Compact and malicious private set intersection for small sets, Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security,CCS 2021. (2021) 1166--1181."},{"key":"e_1_3_2_1_16_1","first-page":"2505","volume-title":"Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, CCS 2022","author":"Raghuraman S.","year":"2022","unstructured":"S. Raghuraman, P. Rindal, Blazing fast PSI from improved OKVS and subfield VOLE, in: H. Yin, A. Stavrou, C. Cremers, E. Shi (Eds.), Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, CCS 2022, Los Angeles, CA, USA, November 7--11, 2022, ACM, 2022, pp. 2505--2517."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2017.12"},{"key":"e_1_3_2_1_18_1","first-page":"276","volume-title":"CSF 2017 Computer Security Foundations Symposium, IEEE Computer Society Press","author":"Hallgren P. A.","year":"2017","unstructured":"P. A. Hallgren, C. Orlandi, A. Sabelfeld, PrivatePool: Privacy-preserving ridesharing, in: B. K\u00f6pf, S. Chong (Eds.), CSF 2017 Computer Security Foundations Symposium, IEEE Computer Society Press, 2017, pp. 276--291."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24676-3_1"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Y. Zhao S. S. M. Chow Are you the one to share? Secret transfer with access structure PoPETs 2017 (2017) 149--169.","DOI":"10.1515\/popets-2017-0010"},{"key":"e_1_3_2_1_21_1","first-page":"154","volume-title":"An algebraic approach to maliciously secure private set intersection, in: [40]","author":"Ghosh S.","unstructured":"S. Ghosh, T. Nilges, An algebraic approach to maliciously secure private set intersection, in: [40], pp. 154--185."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26951-7_1"},{"key":"e_1_3_2_1_23_1","first-page":"349","volume-title":"Multi-party threshold private set intersection with sublinear communication, in: [41]","author":"Badrinarayanan S.","unstructured":"S. Badrinarayanan, P. Miao, S. Raghuraman, P. Rindal, Multi-party threshold private set intersection with sublinear communication, in: [41], pp. 349--379."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-78372-7_5"},{"key":"e_1_3_2_1_25_1","first-page":"32","volume-title":"Multiparty cardinality testing for threshold private intersection, in: [41]","author":"Branco P.","unstructured":"P. Branco, N. D\u00f6ttling, S. Pu, Multiparty cardinality testing for threshold private intersection, in: [41], pp. 32--60."},{"key":"e_1_3_2_1_26_1","volume-title":"Proceedings of the 2018 Workshop on Privacy in the Electronic Society, WPES@CCS","author":"Zhao Y.","year":"2018","unstructured":"Y. Zhao, S. S. M. Chow, Can you find the one for me? Privacy-preserving matchmaking via threshold PSI, Proceedings of the 2018 Workshop on Privacy in the Electronic Society, WPES@CCS, 2018."},{"key":"e_1_3_2_1_27_1","first-page":"122","volume-title":"Efficient circuit-based PSI with linear communication, in: [40]","author":"Pinkas B.","unstructured":"B. Pinkas, T. Schneider, O. Tkachenko, A. Yanai, Efficient circuit-based PSI with linear communication, in: [40], pp. 122--153."},{"key":"e_1_3_2_1_28_1","first-page":"1182","volume-title":"ACM CCS 2021","author":"Chandran N.","year":"2021","unstructured":"N. Chandran, N. Dasgupta, D. Gupta, S. L. B. Obbattu, S. Sekar, A. Shah, Efficient linear multiparty PSI and extensions to circuit\/quorum PSI, in: G. Vigna, E. Shi (Eds.), ACM CCS 2021, ACM Press, 2021, pp. 1182--1204."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-77886-6_31"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/12130.12137"},{"key":"e_1_3_2_1_31_1","volume-title":"Foundations of cryptography. basic applications","author":"Oded G.","year":"2004","unstructured":"G. Oded, Foundations of cryptography. basic applications, vol. 2, 2004."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875553"},{"key":"e_1_3_2_1_33_1","series-title":"SIAM Journal on Computing 12 (1983) 656--666.","volume-title":"Authenticated algorithms for byzantine agreement","author":"Dolev D.","unstructured":"D. Dolev, H. R. Strong, Authenticated algorithms for byzantine agreement, SIAM Journal on Computing 12 (1983) 656--666."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2007.44"},{"key":"e_1_3_2_1_35_1","volume-title":"Foundations of cryptography","author":"Goldreich O.","year":"2009","unstructured":"O. Goldreich, Foundations of cryptography: volume 2, basic applications, Cambridge university press, 2009."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72540-4_18"},{"key":"e_1_3_2_1_37_1","unstructured":"S. Goldwasser Y. Lindell Secure computation without agreement Cryptology ePrint Archive Report 2002\/040 2002. https:\/\/eprint.iacr.org\/2002\/040."},{"key":"e_1_3_2_1_38_1","series-title":"LNCS","first-page":"643","volume-title":"R","author":"Damg\u00e5rd I.","year":"2012","unstructured":"I. Damg\u00e5rd, V. Pastro, N. P. Smart, S. Zakarias, Multiparty computation from somewhat homomorphic encryption, in: R. Safavi-Naini, R. Canetti (Eds.), CRYPTO 2012, volume 7417 of LNCS, Springer, Heidelberg, 2012, pp. 643--662."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30576-7_17"},{"key":"e_1_3_2_1_40_1","series-title":"LNCS","volume-title":"EUROCRYPT","author":"Ishai Y.","year":"2019","unstructured":"Y. Ishai, V. Rijmen (Eds.), EUROCRYPT 2019, Part III, volume 11478 of LNCS, Springer, Heidelberg, 2019."},{"key":"e_1_3_2_1_41_1","series-title":"LNCS","volume-title":"PKC","author":"Garay J.","year":"2021","unstructured":"J. Garay (Ed.), PKC 2021, Part II, volume 12711 of LNCS, Springer, Heidelberg, 2021."}],"event":{"name":"CCS '23: ACM SIGSAC Conference on Computer and Communications Security","location":"Copenhagen Denmark","acronym":"CCS '23","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3576915.3623158","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3576915.3623158","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3576915.3623158","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T01:44:34Z","timestamp":1755740674000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3576915.3623158"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,15]]},"references-count":41,"alternative-id":["10.1145\/3576915.3623158","10.1145\/3576915"],"URL":"https:\/\/doi.org\/10.1145\/3576915.3623158","relation":{},"subject":[],"published":{"date-parts":[[2023,11,15]]},"assertion":[{"value":"2023-11-21","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}