{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:57:15Z","timestamp":1773377835035,"version":"3.50.1"},"reference-count":34,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":["62572197"],"award-info":[{"award-number":["62572197"]}],"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":["62132005"],"award-info":[{"award-number":["62132005"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans.Inform.Forensic Secur."],"published-print":{"date-parts":[[2026]]},"DOI":"10.1109\/tifs.2026.3671114","type":"journal-article","created":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T20:42:22Z","timestamp":1772743342000},"page":"2534-2548","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Malicious Multiparty Private Set Intersection Supporting Cardinality, Sharing, and Batching"],"prefix":"10.1109","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-7148-0154","authenticated-orcid":false,"given":"Xiyuan","family":"Han","sequence":"first","affiliation":[{"name":"Shanghai Key Laboratory of Trustworthy Computing, East China Normal University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6066-9879","authenticated-orcid":false,"given":"Jun","family":"Zhou","sequence":"additional","affiliation":[{"name":"Shanghai Key Laboratory of Trustworthy Computing, East China Normal University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5250-5030","authenticated-orcid":false,"given":"Zhenfu","family":"Cao","sequence":"additional","affiliation":[{"name":"Shanghai Key Laboratory of Trustworthy Computing, East China Normal University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5844-0223","authenticated-orcid":false,"given":"Xiaolei","family":"Dong","sequence":"additional","affiliation":[{"name":"Shanghai Key Laboratory of Trustworthy Computing, East China Normal University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9208-5336","authenticated-orcid":false,"given":"Kim-Kwang Raymond","family":"Choo","sequence":"additional","affiliation":[{"name":"Department of Information Systems and Cybersecurity, The University of Texas at San Antonio, San Antonio, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24676-3_1"},{"key":"ref2","doi-asserted-by":"crossref","DOI":"10.1016\/j.cosrev.2023.100567","article-title":"Private set intersection: A systematic literature review","volume":"49","author":"Morales","year":"2023","journal-title":"Comput. Sci. Rev."},{"key":"ref3","first-page":"7","article-title":"BotGrep: Finding P2P bots with structured graph analysis","volume-title":"Proc. 19th USENIX Secur. Symp. (USENIX Secur.)","author":"Nagaraja"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3423358"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/EuroSP48549.2020.00031"},{"key":"ref6","first-page":"6435","article-title":"Unbalanced circuit-PSI from oblivious key-value retrieval","volume-title":"Proc. 33rd USENIX Secur. Symp. (USENIX Secur.)","author":"Hao"},{"key":"ref7","article-title":"Protecting user privacy in private set intersection: A journey toward mitigating user tracking","volume-title":"Proc. USENIX Conf. Privacy Eng. Pract. Respect (PEPR)","author":"Du","year":"2023"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45724-2_25"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-77886-6_31"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3560642"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484760"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3560658"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3559378"},{"key":"ref14","article-title":"Private computation on set intersection with sublinear communication","author":"Janneck","year":"2022"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26951-7_1"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-38557-5_19"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134065"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17659-4_5"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-75248-4_21"},{"key":"ref20","article-title":"PEPSI: Practically efficient private set intersection in the unbalanced setting","author":"Akhavan Mahdavi","year":"2023","journal-title":"arXiv:2310.14565"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3579856.3582817"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.56553\/popets-2024-0041"},{"key":"ref23","first-page":"283","article-title":"Efficient unbalanced private set intersection cardinality and user-friendly privacy-preserving contact tracing","volume-title":"Proc. 32nd USENIX Secur. Symp. (USENIX Secur.)","author":"Wu"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/3338466.3358927"},{"key":"ref25","article-title":"Fast multi-party private set operations in the star topology from secure ands and ors","author":"Vos","year":"2022"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484591"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484772"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/3658644.3690245"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2024.120995"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.21236\/ADA457144"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TrustCom63139.2024.00191"},{"key":"ref32","first-page":"5949","article-title":"Batch PIR and labeled PSI with oblivious ciphertext compression","volume-title":"Proc. 33rd USENIX Secur. Symp. (USENIX Secur.)","author":"Bienstock"},{"key":"ref33","article-title":"Epione: Lightweight contact tracing with strong privacy","author":"Trieu","year":"2020","journal-title":"arXiv:2004.13293"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-84245-1_14"}],"container-title":["IEEE Transactions on Information Forensics and Security"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10206\/11313711\/11422276.pdf?arnumber=11422276","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:18Z","timestamp":1773347718000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11422276\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":34,"URL":"https:\/\/doi.org\/10.1109\/tifs.2026.3671114","relation":{},"ISSN":["1556-6013","1556-6021"],"issn-type":[{"value":"1556-6013","type":"print"},{"value":"1556-6021","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]}}}