{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,13]],"date-time":"2026-07-13T21:08:39Z","timestamp":1783976919877,"version":"3.55.0"},"reference-count":60,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"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"]}]},{"name":"Key Program of the National Natural Science Foundation of China","award":["62032012"],"award-info":[{"award-number":["62032012"]}]},{"name":"Key Program of the National Natural Science Foundation of China","award":["62432012"],"award-info":[{"award-number":["62432012"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Dependable and Secure Comput."],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1109\/tdsc.2026.3689866","type":"journal-article","created":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T19:56:55Z","timestamp":1777665415000},"page":"8891-8908","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Circuit-PSI and Extensions via Distributed Key-Value Store"],"prefix":"10.1109","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-4101-0793","authenticated-orcid":false,"given":"Ranyang","family":"Liu","sequence":"first","affiliation":[{"name":"DISSec, College of Cryptology and Cyber Science, 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":"DISSec, College of Cryptology and Cyber Science, Nankai University, Tianjin, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5858-5070","authenticated-orcid":false,"given":"Xiaofeng","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Cyber Engineering, Xidian University, Xi’an, 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":"DISSec, College of Cryptology and Cyber Science, Nankai University, Tianjin, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978331"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3560691"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2046707.2046785"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46766-1_34"},{"key":"ref5","first-page":"301","article-title":"$\\lbrace${Near-optimal $\\rbrace$} oblivious $\\lbrace${ Key-value $\\rbrace$} stores for efficient $\\lbrace${ PSI$\\rbrace,\\lbrace$},{PSU $\\rbrace$} and $\\lbrace${ Volume-hiding $\\rbrace$}$\\lbrace${ Multi-maps$\\rbrace$}","volume-title":"Proc. 32nd USENIX Secur. Symp.","author":"Bienstock","year":"2023"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3708821.3710839"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.2478\/popets-2022-0018"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64840-4_12"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/JETCAS.2024.3491169"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-57725-3_13"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3579856.3582826"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-98113-0_25"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/SP46214.2022.9833611"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2015.23113"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2023.3264697"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2025.3554329"},{"key":"ref17","first-page":"7603","article-title":"Learning from functionality outputs: Private join and compute in the real world","volume-title":"Proc. 34th USENIX Secur. Symp.","author":"Falzon","year":"2025"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2025.3555284"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-75248-4_21"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-84245-1_14"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-31371-4_9"},{"key":"ref22","first-page":"218","article-title":"How to play any mental game or a completeness theorem for protocols with honest majority","volume-title":"Proc. 19th Annu. ACM Symp. Theory Comput.","author":"Goldreich","year":"1987"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.2478\/popets-2019-0034"},{"key":"ref24","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.","author":"Guo","year":"2022"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE53745.2022.00176"},{"key":"ref26","first-page":"6435","article-title":"Unbalanced circuit-PSI from oblivious key-value retrieval","volume-title":"Proc. 33rd USENIX Secur. Symp.","author":"Hao","year":"2024"},{"key":"ref27","article-title":"Private set intersection: Are garbled circuits better than custom protocols?","volume-title":"Proc. Netw. Distrib. System Secur. Symp.","author":"Huang","year":"2012"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/EuroSP48549.2020.00031"},{"key":"ref29","first-page":"6471","article-title":"Scalable private set union, with stronger security","volume-title":"Proc. 33rd USENIX Secur. Symp.","author":"Jia","year":"2024"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2024.241279"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/EuroSP48549.2020.00032"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-45472-5_13"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/SP54263.2024.00128"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978381"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134065"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-34621-8_23"},{"key":"ref37","first-page":"2651","article-title":"$\\lbrace${SWIFT $\\rbrace$}: Super-fast and robust $\\lbrace${ Privacy-Preserving$\\rbrace$} machine learning","volume-title":"Proc. 30th USENIX Secur. Symp.","author":"Koti","year":"2021"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3345661"},{"key":"ref39","article-title":"PsiBench: Pragmatic benchmark of two-party private set intersection.","author":"Liang","year":"2020","journal-title":"Cryptol. ePrint Arch."},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/3658644.3670274"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-57048-8_6"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2026.240131"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2025.3550059"},{"key":"ref44","first-page":"35","article-title":"ABY3: A mixed protocol framework for machine learning","volume-title":"Proc. ACM SIGSAC Conf. Comput. Commun. Secur.","author":"Mohassel"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38348-9_33"},{"key":"ref46","first-page":"515","article-title":"Phasing: Private set intersection using permutation-based hashing","volume-title":"Proc. 24th USENIX Secur. Symp.","author":"Pinkas","year":"2015"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17659-4_5"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-78372-7_5"},{"key":"ref49","first-page":"797","article-title":"Faster private set intersection based on OT extension","volume-title":"Proc. 23rd USENIX Secur. Symp., San Diego, CA, USA","author":"Pinkas","year":"2014"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1145\/3154794"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3560658"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-77886-6_31"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1145\/3579856.3582817"},{"key":"ref54","first-page":"3437","article-title":"Fast enhanced private set union in the balanced and unbalanced scenarios","volume-title":"Proc. 34th USENIX Secur. Symp.","author":"Tu","year":"2025"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.2478\/popets-2019-0035"},{"key":"ref56","first-page":"3495","article-title":"$\\lbrace${GraphGuard $\\rbrace$}: Private $\\lbrace${ Time-Constrained$\\rbrace$} pattern detection over streaming graphs in the cloud","volume-title":"Proc. 33rd USENIX Secur. Symp.","author":"Wang","year":"2024"},{"key":"ref57","first-page":"337","article-title":"Linear private set union from $\\lbrace${Multi-Query$\\rbrace$} reverse private membership test","volume-title":"Proc. 32nd USENIX Secur. Symp.","author":"Zhang","year":"2023"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2024.3372505"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1145\/3658644.3690314"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1145\/3658644.3670292"}],"container-title":["IEEE Transactions on Dependable and Secure Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/8858\/11603880\/11503821.pdf?arnumber=11503821","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,13]],"date-time":"2026-07-13T20:09:18Z","timestamp":1783973358000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11503821\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":60,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tdsc.2026.3689866","relation":{},"ISSN":["1545-5971","1941-0018","2160-9209"],"issn-type":[{"value":"1545-5971","type":"print"},{"value":"1941-0018","type":"electronic"},{"value":"2160-9209","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7]]}}}