{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T10:29:50Z","timestamp":1766053790270,"version":"3.48.0"},"reference-count":52,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62441226"],"award-info":[{"award-number":["62441226"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62572020"],"award-info":[{"award-number":["62572020"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U24A20240"],"award-info":[{"award-number":["U24A20240"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62402363"],"award-info":[{"award-number":["62402363"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"Young Elite Scientists Sponsorship Program by China Association for Science and Technology","doi-asserted-by":"publisher","award":["2023QNRC001"],"award-info":[{"award-number":["2023QNRC001"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["XJSJ24066"],"award-info":[{"award-number":["XJSJ24066"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Shaanxi Province Postdoctoral Research Funding Program","award":["2024BSHSDZZ106"],"award-info":[{"award-number":["2024BSHSDZZ106"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans.Inform.Forensic Secur."],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/tifs.2025.3639987","type":"journal-article","created":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T18:39:35Z","timestamp":1765219175000},"page":"13011-13025","source":"Crossref","is-referenced-by-count":0,"title":["EoTMP: Efficient Over-Threshold Multi-Party Private Set Intersection"],"prefix":"10.1109","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-9935-9292","authenticated-orcid":false,"given":"Qingwen","family":"Li","sequence":"first","affiliation":[{"name":"State Key Laboratory of Integrated Services Networks, Xidian University, Xi’an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0467-6203","authenticated-orcid":false,"given":"Song","family":"Bian","sequence":"additional","affiliation":[{"name":"School of Cyber Science and Technology, Beihang University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8310-7169","authenticated-orcid":false,"given":"Hui","family":"Li","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Integrated Services Networks, Xidian University, Xi’an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1839-1607","authenticated-orcid":false,"given":"Xiaoguang","family":"Li","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Integrated Services Networks, Xidian University, Xi’an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8037-6769","authenticated-orcid":false,"given":"Xingwen","family":"Zhao","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Integrated Services Networks, Xidian University, Xi’an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1080\/13662716.2021.1967727"},{"issue":"1","key":"ref2","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1109\/JSAIT.2021.3057597","article-title":"Multi-party private set intersection: An information-theoretic approach","volume":"2","author":"Wang","year":"2021","journal-title":"IEEE J. Sel. Areas Inf. Theory"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484591"},{"issue":"3","key":"ref4","doi-asserted-by":"crossref","first-page":"291","DOI":"10.56553\/popets-2022-0073","article-title":"Fully secure PSI via MPC-in-the-head","volume":"2022","author":"Gordon","year":"2022","journal-title":"Proc. Privacy Enhancing Technol."},{"key":"ref5","doi-asserted-by":"crossref","DOI":"10.1016\/j.csi.2023.103764","article-title":"Efficient multi-party private set intersection protocols for large participants and small sets","volume":"87","author":"Wei","year":"2024","journal-title":"Comput. Standards Interfaces"},{"key":"ref6","first-page":"2129","article-title":"Senate: A maliciously-secure MPC platform for collaborative analytics","volume-title":"Proc. USENIX Secur. Symp.","author":"Poddar"},{"key":"ref7","first-page":"515","article-title":"Multi-party private set intersection protocols for practical applications","volume-title":"Proc. 18th Int. Conf. Secur. Cryptography","author":"Bay"},{"key":"ref8","article-title":"Fast multi-party private set operations in the star topology from secure ands and ORs","author":"Vos","year":"2022","journal-title":"Cryptol. ePrint Arch."},{"key":"ref9","first-page":"713","article-title":"Privacy-preserving multi-set operations","volume-title":"Proc. IEEE 14th Int. Conf. Commun. Technol.","author":"Huang"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1177\/0967010611399615"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1142\/s021853939400009x"},{"key":"ref12","first-page":"1447","article-title":"Mobile private contact discovery at scale","volume-title":"Proc. 28th USENIX Security Symp.","author":"Kales"},{"key":"ref13","first-page":"636","article-title":"Scalable private set union from symmetric-key techniques","volume-title":"Proc. Int. Conf. Theory Appl. Cryptol. Inf. Secur.","volume":"2019","author":"Kolesnikov"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TIFS.2021.3118879","article-title":"Practical multi-party private set intersection protocols","volume":"17","author":"Bay","year":"2022","journal-title":"IEEE Trans. Inf. Forensics Security"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1007\/978-3-319-25645-0_26","article-title":"A scalable multiparty private set intersection","volume-title":"Proc. Int. Conf. Netw. Syst. Secur.","volume":"9408","author":"Miyaji"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3427228.3427267"},{"key":"ref17","first-page":"133","article-title":"Performance comparison of secure comparison protocols","volume-title":"Proc. 20th Int. Workshop Database Expert Syst. Appl.","author":"Kerschbaum"},{"key":"ref18","article-title":"Manticore: Efficient framework for scalable secure multiparty computation protocols","author":"Carpov","year":"2021","journal-title":"Cryptol. ePrint Arch."},{"key":"ref19","doi-asserted-by":"crossref","DOI":"10.1016\/j.scico.2022.102840","article-title":"A decentralized analysis of multiparty protocols","volume":"222","author":"van den Heuvel","year":"2022","journal-title":"Sci. Comput. Program."},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-017-0316-0"},{"issue":"11","key":"ref21","doi-asserted-by":"crossref","first-page":"2705","DOI":"10.1109\/TPDS.2021.3074440","article-title":"MCFsyn: A multi-party set reconciliation protocol with the marked cuckoo filter","volume":"32","author":"Luo","year":"2021","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-023-09452-8"},{"issue":"4","key":"ref23","doi-asserted-by":"crossref","first-page":"291","DOI":"10.2478\/popets-2021-0071","article-title":"Multiparty homomorphic encryption from ring-learning-with-errors","volume":"2021","author":"Mouchet","year":"2021","journal-title":"Proc. Privacy Enhancing Technol."},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134065"},{"key":"ref25","first-page":"134","article-title":"A more efficient cryptographic matchmaking protocol for use in the absence of a continuously available third party","volume-title":"Proc. IEEE Symp. Secur. Privacy","author":"Meadows"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516701"},{"key":"ref27","first-page":"126","article-title":"Amortizing Rate-1 OT and applications to PIR and PSI","volume-title":"Proc. 19th Int. Conf. Theory Cryptography","author":"Chase"},{"key":"ref28","first-page":"739","article-title":"PSI from PaXoS: Fast, malicious private set intersection","volume-title":"Proc. Annu. Int. Conf. Theory Appl. Cryptograph. Techn.","author":"Pinkas"},{"article-title":"Private set intersection: Are garbled circuits better than custom protocols?","volume-title":"Proc. Netw. Distrib. Syst. Secur. Symp. (NDSS)","author":"Huang","key":"ref29"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17659-4_5"},{"key":"ref31","first-page":"283","article-title":"Efficient unbalanced private set intersection cardinality and user-friendly privacy-preserving contact tracing","volume-title":"Proc. USENIX Secur. Symp.","author":"Wu"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134061"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484778"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/3603114"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3560658"},{"key":"ref36","doi-asserted-by":"crossref","DOI":"10.21236\/ADA461119","article-title":"Private and threshold set-intersection","author":"Kissner","year":"2004"},{"key":"ref37","first-page":"223","article-title":"Public-key cryptosystems based on composite degree residuosity classes","volume-title":"Proc. Int. Conf. Theory Appl. Cryptograph. Techn.","author":"Paillier"},{"key":"ref38","first-page":"522","article-title":"Efficient binary conversion for Paillier encrypted values","volume-title":"Proc. 24th Annu. Int. Conf. Theory Appl. Cryptograph. Techn. Adv. Cryptol.","author":"Schoenmakers"},{"key":"ref39","first-page":"1","article-title":"Efficient private matching and set intersection","volume-title":"Proc. Int. Conf. Theory Appl. Cryptograph. Techn.","author":"Freedman"},{"key":"ref40","first-page":"149","article-title":"Are you the one to share? Secret transfer with access structure","volume-title":"Proc. Privacy Enhancing Technol.","author":"Zhao"},{"key":"ref41","first-page":"3","article-title":"The communication complexity of threshold private set intersection","volume-title":"Proc. Annu. Int. Cryptol. Conf.","author":"Ghosh"},{"key":"ref42","first-page":"125","article-title":"Efficient circuit-based PSI via cuckoo hashing","volume-title":"Proc. Annu. Int. Conf. Theory Appl. Cryptograph. Techn.","author":"Pinkas"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/3267323.3268965"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/3576915.3623158"},{"key":"ref45","first-page":"349","article-title":"Multi-party threshold private set intersection with sublinear communication","volume-title":"Proc. IACR Int. Conf. Public-Key Cryptogr.","author":"Badrinarayanan"},{"key":"ref46","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/978-3-319-57048-8_6","article-title":"How to simulate it\u2014A tutorial on the simulation proof technique","author":"Lindell","year":"2017","journal-title":"Tutorials on the Foundations of Cryptography: Dedicated to Oded Goldreich"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484760"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/SP54263.2024.00079"},{"volume-title":"Lattigo V5","year":"2023","key":"ref50"},{"volume-title":"Murmurhash3","year":"2019","key":"ref51"},{"key":"ref52","first-page":"31","article-title":"Homomorphic encryption standard","author":"Albrecht","year":"2019","journal-title":"Protecting Privacy Through Homomorphic Encryption"}],"container-title":["IEEE Transactions on Information Forensics and Security"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10206\/10810755\/11284781.pdf?arnumber=11284781","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T10:24:58Z","timestamp":1766053498000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11284781\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":52,"URL":"https:\/\/doi.org\/10.1109\/tifs.2025.3639987","relation":{},"ISSN":["1556-6013","1556-6021"],"issn-type":[{"type":"print","value":"1556-6013"},{"type":"electronic","value":"1556-6021"}],"subject":[],"published":{"date-parts":[[2025]]}}}