{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T20:25:45Z","timestamp":1783110345979,"version":"3.54.6"},"reference-count":49,"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":[{"name":"National Cryptologic Science Fund of China","award":["2025NCSF01010"],"award-info":[{"award-number":["2025NCSF01010"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62272251"],"award-info":[{"award-number":["62272251"]}],"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":["62432012"],"award-info":[{"award-number":["62432012"]}],"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":["U25B2028"],"award-info":[{"award-number":["U25B2028"]}],"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.3705332","type":"journal-article","created":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T20:09:20Z","timestamp":1781813360000},"page":"6020-6035","source":"Crossref","is-referenced-by-count":0,"title":["A Unified Framework of Private Set Operations With Stronger Security"],"prefix":"10.1109","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-4101-0793","authenticated-orcid":false,"given":"Ranyang","family":"Liu","sequence":"first","affiliation":[{"name":"College of Cryptology and Cyber Science, DISSec, Nankai University, Tianjin, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5295-2781","authenticated-orcid":false,"given":"Xiaojie","family":"Guo","sequence":"additional","affiliation":[{"name":"Shanghai Qi Zhi Institute, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3678-8402","authenticated-orcid":false,"given":"Tong","family":"Li","sequence":"additional","affiliation":[{"name":"College of Cryptology and Cyber Science, DISSec, Nankai University, Tianjin, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2984-2661","authenticated-orcid":false,"given":"Zheli","family":"Liu","sequence":"additional","affiliation":[{"name":"College of Cryptology and Cyber Science, DISSec, Nankai University, Tianjin, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","first-page":"797","article-title":"Faster private set intersection based on OT extension","volume-title":"Proc. 23rd USENIX Secur. Symp.","author":"Pinkas"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-77886-6_31"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2046707.2046785"},{"key":"ref4","first-page":"1447","article-title":"Mobile private contact discovery at scale","volume-title":"Proc. 28th USENIX Security Symp.","author":"Kales"},{"key":"ref5","first-page":"515","article-title":"Phasing: Private set intersection using permutation-based hashing","volume-title":"Proc. 24th USENIX Conf. Secur. Symp.","author":"Pinkas"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72738-5_16"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-34621-8_23"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2020.24232"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/SecDev.2016.028"},{"key":"ref10","first-page":"599","article-title":"Private matching for compute","volume":"2020","author":"Buddhavarapu","year":"2020","journal-title":"Cryptol. ePrint Arch."},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-75248-4_21"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35404-5_17"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/EuroSP48549.2020.00031"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-56877-1_1"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-57725-3_13"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.3233\/JCS-2005-13401"},{"key":"ref17","first-page":"1487","article-title":"Birds of a feather flock together: How set bias helps to deanonymize you via revealed intersection sizes","volume-title":"Proc. 31st USENIX Secur. Symp. (USENIX Secur.)","author":"Guo"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2024.241279"},{"key":"ref19","first-page":"6471","article-title":"Scalable private set union, with stronger security","volume-title":"Proc. 33rd USENIX Secur. Symp. (USENIX Secur.)","author":"Jia"},{"key":"ref20","first-page":"2947","article-title":"Shuffle-based private set union: Faster and more secure","volume-title":"Proc. 31st USENIX Secur. Symp. (USENIX Secur.)","author":"Jia"},{"key":"ref21","first-page":"337","article-title":"Linear private set union from Multi-Query reverse private membership test","volume-title":"32nd USENIX Secur. Symp. (USENIX Secur. 23)","author":"Zhang"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3576915.3623064"},{"key":"ref23","first-page":"301","article-title":"Near-optimal oblivious key-value stores for efficient PSI, PSU and volume-hiding multi-maps","volume-title":"Proc. 32nd USENIX Secur. Symp. (USENIX Secur.)","author":"Bienstock"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/3658644.3690308"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978381"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-84245-1_14"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3560658"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.21236\/ADA457144"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-59870-3_15"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/336992.337012"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.002"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/3154794"},{"key":"ref33","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":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134061"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484760"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/3579856.3582817"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45146-4_9"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64840-4_12"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293350"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/SP46215.2023.10179329"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38348-9_33"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2015.23113"},{"key":"ref43","first-page":"551","article-title":"A note on the relation between the definitions of security for semi-honest and malicious adversaries","volume":"2010","author":"Hazay","year":"2010"},{"key":"ref44","article-title":"PsiBench: Pragmatic benchmark of two-party private set intersection","author":"Liang","year":"2020","journal-title":"Cryptol. ePrint Arch."},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.2478\/popets-2022-0018"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516738"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417276"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46766-1_34"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-99-7563-1_20"}],"container-title":["IEEE Transactions on Information Forensics and Security"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10206\/11313711\/11570204.pdf?arnumber=11570204","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T19:51:54Z","timestamp":1783108314000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11570204\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":49,"URL":"https:\/\/doi.org\/10.1109\/tifs.2026.3705332","relation":{},"ISSN":["1556-6013","1556-6021"],"issn-type":[{"value":"1556-6013","type":"print"},{"value":"1556-6021","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]}}}