{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T07:53:52Z","timestamp":1768204432072,"version":"3.49.0"},"reference-count":41,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T00:00:00Z","timestamp":1766102400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62472252"],"award-info":[{"award-number":["62472252"]}],"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":["62172258"],"award-info":[{"award-number":["62172258"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007129","name":"Natural Science Foundation of Shandong Province","doi-asserted-by":"publisher","award":["ZR2024QF131"],"award-info":[{"award-number":["ZR2024QF131"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007129","name":"Natural Science Foundation of Shandong Province","doi-asserted-by":"publisher","award":["ZR2023LZH014"],"award-info":[{"award-number":["ZR2023LZH014"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007129","name":"Natural Science Foundation of Shandong Province","doi-asserted-by":"publisher","award":["ZR2022ZD01"],"award-info":[{"award-number":["ZR2022ZD01"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007129","name":"Natural Science Foundation of Shandong Province","doi-asserted-by":"publisher","award":["ZR2022MF264"],"award-info":[{"award-number":["ZR2022MF264"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007129","name":"Natural Science Foundation of Shandong Province","doi-asserted-by":"publisher","award":["ZR2021LZH007"],"award-info":[{"award-number":["ZR2021LZH007"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100012905","name":"Department of Science and Technology of Shandong Province","doi-asserted-by":"publisher","award":["SYS202201"],"award-info":[{"award-number":["SYS202201"]}],"id":[{"id":"10.13039\/100012905","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Concurrency and Computation"],"published-print":{"date-parts":[[2026,1]]},"abstract":"<jats:title>ABSTRACT<\/jats:title>\n                  <jats:p>Private set operations (PSO) address key challenges in cross\u2010organizational data sharing where multiple transport entities securely verify shared cargo manifests or delivery schedules without exposing sensitive information. Private set intersection (PSI) enables secure computation of common elements across private datasets, while its variant, PSI with cardinality (PSI\u2010CA), reveals only the intersection size. The PSO protocol based on Diffie\u2010Hellman (DH) key agreement has emerged as a prominent solution for communication\u2010sensitive applications. However, current research efforts mostly concentrate on two\u2010party implementations, which face inherent limitations in addressing the communication complexity when scaling to multiple participants. In this work, we firstly present E3PSI\u2010CA, a novel three\u2010party PSO protocol. This construction for the semi\u2010honest model leverages bilinear maps in DH key agreement and Bloom Filters (BF) for compact set representation, achieving remarkable efficiency. By integrating private information retrieval (PIR) techniques, the party in E3PSI\u2010CAcan efficiently compute the set intersection. To address the inherent accuracy limitations of the BF and extend security to the malicious model, we further propose an enhanced PSI scheme. This variant is built upon a \u201cRing\u201d structure, within which we employ DH key agreement and OKVS data structure to achieve security against any single malicious party, while the OKVS simultaneously ensures perfect accuracy (zero false positives). We prove the security through the ideal\/real simulation paradigm and conduct performance evaluations.<\/jats:p>","DOI":"10.1002\/cpe.70513","type":"journal-article","created":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T04:55:55Z","timestamp":1766206555000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Three\u2010Party Private Set Operation With Bilinear Map"],"prefix":"10.1002","volume":"38","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2248-5654","authenticated-orcid":false,"given":"Jun","family":"Xu","sequence":"first","affiliation":[{"name":"Quan Cheng Laboratory  Jinan China"},{"name":"Shandong Key Laboratory of Ubiquitous Intelligent Computing University of Jinan  Jinan China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"Shang","sequence":"additional","affiliation":[{"name":"Shandong Key Laboratory of Ubiquitous Intelligent Computing University of Jinan  Jinan China"},{"name":"Shandong Metallurgical Research Institute Co. Ltd  Jinan China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6883-9724","authenticated-orcid":false,"given":"Shengnan","family":"Zhao","sequence":"additional","affiliation":[{"name":"Quan Cheng Laboratory  Jinan China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Baoyin","family":"Sun","sequence":"additional","affiliation":[{"name":"Quan Cheng Laboratory  Jinan China"},{"name":"Shandong Key Laboratory of Ubiquitous Intelligent Computing University of Jinan  Jinan China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shan","family":"Jing","sequence":"additional","affiliation":[{"name":"Shandong Key Laboratory of Ubiquitous Intelligent Computing University of Jinan  Jinan China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhenxiang","family":"Chen","sequence":"additional","affiliation":[{"name":"Shandong Key Laboratory of Ubiquitous Intelligent Computing University of Jinan  Jinan China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9106-6010","authenticated-orcid":false,"given":"Chuan","family":"Zhao","sequence":"additional","affiliation":[{"name":"Quan Cheng Laboratory  Jinan China"},{"name":"Shandong Key Laboratory of Ubiquitous Intelligent Computing University of Jinan  Jinan China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2025,12,19]]},"reference":[{"key":"e_1_2_14_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/J.INS.2018.10.024"},{"key":"e_1_2_14_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134061"},{"key":"e_1_2_14_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-56877-1_2"},{"key":"e_1_2_14_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484778"},{"key":"e_1_2_14_6_1","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.70122"},{"key":"e_1_2_14_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2046707.2046785"},{"key":"e_1_2_14_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64840-4_29"},{"key":"e_1_2_14_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2022.3152591"},{"key":"e_1_2_14_10_1","article-title":"Private Intersection\u2010Sum Protocol With Applications to Attributing Aggregate Ad Conversions","author":"Ion M.","year":"2017","journal-title":"IACR Cryptol EPrint Arch"},{"key":"e_1_2_14_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872771"},{"key":"e_1_2_14_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35404-5_17"},{"key":"e_1_2_14_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17659-4_5"},{"key":"e_1_2_14_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/EuroSP48549.2020.00031"},{"key":"e_1_2_14_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/J.FUTURE.2019.09.022"},{"key":"e_1_2_14_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/J.CSI.2023.103760"},{"key":"e_1_2_14_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCC.2024.3360098"},{"key":"e_1_2_14_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2024.3356667"},{"key":"e_1_2_14_19_1","volume-title":"School of Computer Science, Carnegie Mellon University","author":"Kissner L.","year":"2004"},{"key":"e_1_2_14_20_1","doi-asserted-by":"publisher","DOI":"10.3934\/AMC.2020071"},{"key":"e_1_2_14_21_1","doi-asserted-by":"publisher","DOI":"10.56553\/POPETS\u20102024\u20100041"},{"key":"e_1_2_14_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/J.JISA.2021.102996"},{"key":"e_1_2_14_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/PST58708.2023.10320155"},{"key":"e_1_2_14_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/S11704\u2010022\u20102269\u20100"},{"key":"e_1_2_14_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.1986.10022"},{"key":"e_1_2_14_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/336992.337012"},{"key":"e_1_2_14_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24676-3_1"},{"key":"e_1_2_14_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17373-8_13"},{"key":"e_1_2_14_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15317-4_26"},{"key":"e_1_2_14_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/S00145\u2010004\u20100312\u2010Y"},{"key":"e_1_2_14_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_2_14_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/J.IPL.2008.05.018"},{"key":"e_1_2_14_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45724-2_25"},{"key":"e_1_2_14_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.00062"},{"key":"e_1_2_14_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP46215.2023.10179329"},{"key":"e_1_2_14_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP54263.2024.00039"},{"key":"e_1_2_14_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICMCS.2018.8525881"},{"key":"e_1_2_14_38_1","first-page":"1257","volume-title":"Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security","author":"Kolesnikov V."},{"key":"e_1_2_14_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17659-4_6"},{"key":"e_1_2_14_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484772"},{"key":"e_1_2_14_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484591"},{"key":"e_1_2_14_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40084-1_4"}],"container-title":["Concurrency and Computation: Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/cpe.70513","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T04:49:58Z","timestamp":1768193398000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/cpe.70513"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,19]]},"references-count":41,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,1]]}},"alternative-id":["10.1002\/cpe.70513"],"URL":"https:\/\/doi.org\/10.1002\/cpe.70513","archive":["Portico"],"relation":{},"ISSN":["1532-0626","1532-0634"],"issn-type":[{"value":"1532-0626","type":"print"},{"value":"1532-0634","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,19]]},"assertion":[{"value":"2025-06-24","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-12-09","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-12-19","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"e70513"}}