{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T16:14:09Z","timestamp":1778861649555,"version":"3.51.4"},"reference-count":46,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/100007219","name":"Shanghai Municipal Natural Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100007219","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100018558","name":"Shanghai Shuguang Program","doi-asserted-by":"publisher","award":["25SG49"],"award-info":[{"award-number":["25SG49"]}],"id":[{"id":"10.13039\/501100018558","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003399","name":"Shanghai Municipality Science and Technology Commission","doi-asserted-by":"publisher","award":["25692107400"],"award-info":[{"award-number":["25692107400"]}],"id":[{"id":"10.13039\/501100003399","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62372285"],"award-info":[{"award-number":["62372285"]}],"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":["61972241"],"award-info":[{"award-number":["61972241"]}],"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":["12441101"],"award-info":[{"award-number":["12441101"]}],"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":["61972241,62372285,12441101"],"award-info":[{"award-number":["61972241,62372285,12441101"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003395","name":"Shanghai Municipal Education Commission","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003395","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003024","name":"Shanghai Education Development Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003024","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Information Security and Applications"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1016\/j.jisa.2026.104460","type":"journal-article","created":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T23:21:05Z","timestamp":1775517665000},"page":"104460","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Towards efficient malicious-secure multi-party private set union: Harnessing trusted execution environments"],"prefix":"10.1016","volume":"99","author":[{"given":"Jianzhong","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0243-9995","authenticated-orcid":false,"given":"Lifei","family":"Wei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2339-2356","authenticated-orcid":false,"given":"Jinjiao","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kai","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianting","family":"Ning","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.jisa.2026.104460_bib0001","doi-asserted-by":"crossref","first-page":"2505","DOI":"10.1145\/3548606.3560658","article-title":"Blazing fast PSI from improved OKVS and subfield VOLE","author":"Raghuraman","year":"2022","journal-title":"Proc 2022 ACM SIGSAC Conf Comput Commun Secur"},{"key":"10.1016\/j.jisa.2026.104460_bib0002","first-page":"1098","article-title":"Psimple: practical multiparty maliciously-secure private set intersection","author":"Ben-Efraim","year":"2022","journal-title":"Proc 2022 ACM Asia Conf Comput Commun Secur"},{"key":"10.1016\/j.jisa.2026.104460_bib0003","doi-asserted-by":"crossref","first-page":"1182","DOI":"10.1145\/3460120.3484591","article-title":"Efficient linear multiparty PSI and extensions to circuit\/quorum PSI","author":"Chandran","year":"2021","journal-title":"Proc 2021 ACM SIGSAC Conf Comput Commun Secur"},{"key":"10.1016\/j.jisa.2026.104460_bib0004","doi-asserted-by":"crossref","first-page":"1257","DOI":"10.1145\/3133956.3134065","article-title":"Practical multiparty private set intersection from symmetric-key techniques","author":"Kolesnikov","year":"2017","journal-title":"Proc 2017 ACM SIGSAC Conf Comput Commun Secur"},{"key":"10.1016\/j.jisa.2026.104460_bib0005","doi-asserted-by":"crossref","first-page":"1151","DOI":"10.1145\/3460120.3484772","article-title":"Simple, fast malicious multiparty private set intersection","author":"Nevo","year":"2021","journal-title":"Proc 2021 ACM SIGSAC Conf Comput Commun Secur"},{"key":"10.1016\/j.jisa.2026.104460_bib0006","doi-asserted-by":"crossref","first-page":"636","DOI":"10.1007\/978-3-030-34621-8_23","article-title":"Scalable private set union from symmetric-key techniques","volume":"11922","author":"Kolesnikov","year":"2019","journal-title":"Adv Cryptol - ASIACRYPT 2019"},{"key":"10.1016\/j.jisa.2026.104460_bib0007","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1007\/978-3-030-75248-4_21","article-title":"Private set operations from oblivious switching","volume":"12711","author":"Garimella","year":"2021","journal-title":"Public-Key Cryptogr - PKC 2021"},{"key":"10.1016\/j.jisa.2026.104460_sbref0008","article-title":"Shuffle-based private set union: faster and more secure","author":"Jia","year":"2022","journal-title":"USENIX 2022"},{"key":"10.1016\/j.jisa.2026.104460_sbref0009","article-title":"Optimal private set union from multi-query reverse private membership test","author":"Zhang","year":"2023","journal-title":"USENIX 2023"},{"key":"10.1016\/j.jisa.2026.104460_bib0010","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-031-57725-3_13","article-title":"Private set operations from multi-query reverse private membership test","author":"Chen","year":"2024","journal-title":"Public-Key Cryptogr - PKC 2024"},{"key":"10.1016\/j.jisa.2026.104460_bib0011","series-title":"CRYPTO 2005","first-page":"241","article-title":"Privacy-preserving set operations","volume":"vol. 3621","author":"Kissner","year":"2005"},{"key":"10.1016\/j.jisa.2026.104460_bib0012","series-title":"ACNS 2007","first-page":"237","article-title":"Privacy-preserving set union","volume":"vol. 4521","author":"Frikken","year":"2007"},{"key":"10.1016\/j.jisa.2026.104460_bib0013","series-title":"2022\u202fIEEE\/ACM 30Th international symposium on quality of service (IWQos)","first-page":"1","article-title":"Nearly optimal protocols for computing multi-party private set union","author":"Gong","year":"2022"},{"key":"10.1016\/j.jisa.2026.104460_bib0014","first-page":"721","article-title":"Fast multi-party private set operations in the star topology from secure ANDs and ORs","author":"Vos","year":"2022","journal-title":"IACR Cryptol ePrint Arch"},{"key":"10.1016\/j.jisa.2026.104460_bib0015","series-title":"Advances in cryptology ASIACRYPT 2023","article-title":"Scalable multi-party private set union from multi-query secret-shared private membership test","author":"Liu","year":"2023"},{"key":"10.1016\/j.jisa.2026.104460_bib0016","series-title":"SCN 2018","first-page":"464","article-title":"Combining private set-intersection with secure two-party computation","volume":"vol. 11035","author":"Ciampi","year":"2018"},{"key":"10.1016\/j.jisa.2026.104460_bib0017","series-title":"32Nd USENIX security symposium, USENIX security 2023","article-title":"Linear private set union from multi-query reverse private membership test","author":"Zhang","year":"2023"},{"key":"10.1016\/j.jisa.2026.104460_bib0018","series-title":"Public key cryptography \u2013 PKC 2012","first-page":"398","article-title":"Constant-round multi-party private set union using reversed laurent series","author":"Seo","year":"2012"},{"key":"10.1016\/j.jisa.2026.104460_bib0019","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1007\/978-3-030-75248-4_25","article-title":"Steel: composable hardware-based stateful and randomised functional encryption","author":"Bhatotia","year":"2021"},{"key":"10.1016\/j.jisa.2026.104460_bib0020","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1016\/j.micpro.2016.12.010","article-title":"Timing attack on noc-based systems: prime+probe attack and noc-based protection","volume":"52","author":"Reinbrecht","year":"2017","journal-title":"Microprocess Microsyst"},{"key":"10.1016\/j.jisa.2026.104460_bib0021","series-title":"Cryptographic hardware and embedded systems \u2013 CHES 2017","first-page":"69","article-title":"Cachezoom: how SGX amplifies the power of cache attacks","author":"Moghimi","year":"2017"},{"key":"10.1016\/j.jisa.2026.104460_bib0022","series-title":"2015\u202fIEEE Symposium on security and privacy","first-page":"640","article-title":"Controlled-channel attacks: deterministic side channels for untrusted operating systems","author":"Xu","year":"2015"},{"key":"10.1016\/j.jisa.2026.104460_bib0023","series-title":"26Th USENIX security symposium (USENIX security 17)","first-page":"557","article-title":"Inferring fine-grained control flow inside {SGX} enclaves with branch shadowing","author":"Lee","year":"2017"},{"key":"10.1016\/j.jisa.2026.104460_bib0024","series-title":"26Th USENIX security symposium (USENIX security 17)","first-page":"523","article-title":"Hacking in darkness: return-oriented programming against secure enclaves","author":"Lee","year":"2017"},{"key":"10.1016\/j.jisa.2026.104460_bib0025","series-title":"27Th USENIX security symposium (USENIX security 18)","first-page":"991","article-title":"Foreshadow: extracting the keys to the intel {SGX} kingdom with transient {Out-of-Order} execution","author":"Van Bulck","year":"2018"},{"key":"10.1016\/j.jisa.2026.104460_bib0026","series-title":"NDSS","article-title":"Obliviate: a data oblivious filesystem for intel sgx","author":"Ahmad","year":"2018"},{"key":"10.1016\/j.jisa.2026.104460_bib0027","series-title":"Proceedings of the nineteenth annual ACM symposium on theory of computing","first-page":"182","article-title":"Towards a theory of software protection and simulation by oblivious RAMs","author":"Goldreich","year":"1987"},{"key":"10.1016\/j.jisa.2026.104460_bib0028","series-title":"Financial cryptography and data security","first-page":"477","article-title":"Secure multiparty computation from SGX","author":"Bahmani","year":"2017"},{"key":"10.1016\/j.jisa.2026.104460_bib0029","series-title":"International conference on the theory and application of cryptology and information security","first-page":"268","article-title":"Practically efficient private set intersection from trusted hardware with side-channels","author":"D\u00f6rre","year":"2023"},{"key":"10.1016\/j.jisa.2026.104460_bib0030","series-title":"Proceedings of the 36th annual international conference on the theory and applications of cryptographic techniques","first-page":"260","article-title":"Formal abstractions for attested execution secure processors","author":"Pass","year":"2017"},{"key":"10.1016\/j.jisa.2026.104460_bib0031","series-title":"New approach for efficient malicious multiparty private set intersection","first-page":"120995","volume":"vol. 678","author":"Lv","year":"2024"},{"key":"10.1016\/j.jisa.2026.104460_bib0032","series-title":"2025\u202fIEEE Symposium on security and privacy (SP)","first-page":"2885","article-title":"Towards efficient and practical multi-party computation under inconsistent trust in TEEs","author":"Hu","year":"2025"},{"key":"10.1016\/j.jisa.2026.104460_bib0033","series-title":"Annual cryptology conference","first-page":"3","article-title":"A simpler variant of universally composable security for standard multiparty computation","author":"Canetti","year":"2015"},{"key":"10.1016\/j.jisa.2026.104460_bib0034","unstructured":"Gao J., Nguyen S., Trieu N. Toward a practical multi-party private set union. 2023. Cryptology ePrint Archive, Paper 2023\/1930, Version: 20240316:210303; https:\/\/eprint.iacr.org\/archive\/2023\/1930\/20240316:210303."},{"key":"10.1016\/j.jisa.2026.104460_bib0035","unstructured":"Dong M., Chen Y., Zhang C., Bai Y. Breaking free: Efficient multi-party private set union without non-collusion assumptions. 2024. 2406.07011; https:\/\/arxiv.org\/abs\/2406.07011."},{"key":"10.1016\/j.jisa.2026.104460_bib0036","series-title":"2018\u202fIEEE International conference on smart computing (SMARTCOMP)","first-page":"309","article-title":"Efficient and quasi-accurate multiparty private set union","author":"Shishido","year":"2018"},{"key":"10.1016\/j.jisa.2026.104460_bib0037","series-title":"2022\u202fIEEE\/ACM 30Th international symposium on quality of service (IWQos)","first-page":"1","article-title":"Nearly optimal protocols for computing multiparty private set union","author":"Gong","year":"2022"},{"issue":"5","key":"10.1016\/j.jisa.2026.104460_bib0038","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1007\/s10207-015-0301-1","article-title":"Private and oblivious set and multiset operations","volume":"15","author":"Blanton","year":"2016","journal-title":"Int J Inf Sec"},{"key":"10.1016\/j.jisa.2026.104460_bib0039","unstructured":"Dong M., Chen Y., Zhang C., Bai Y., Cao Y. Multi-party private set operations from predicative zero-sharing. 2025a. 2504.20050; https:\/\/arxiv.org\/abs\/2504.20050."},{"key":"10.1016\/j.jisa.2026.104460_bib0040","series-title":"34Th USENIX security symposium (USENIX security 25)","first-page":"2005","article-title":"Efficient multi-party private set union without non-collusion assumptions","author":"Dong","year":"2025"},{"key":"10.1016\/j.jisa.2026.104460_bib0041","series-title":"International workshop on randomization and approximation techniques in computer science","first-page":"159","article-title":"\u201cBalls into bins\u201d-a simple and tight analysis","author":"Raab","year":"1998"},{"key":"10.1016\/j.jisa.2026.104460_bib0042","series-title":"Proceedings of the 42nd annual symposium on foundations of computer science","first-page":"136","article-title":"Universally composable security: a new paradigm for cryptographic protocols","author":"Canetti","year":"2001"},{"key":"10.1016\/j.jisa.2026.104460_bib0043","series-title":"Theory of cryptography conference (TCC)","article-title":"Universally composable security with global setup","author":"Canetti","year":"2007"},{"key":"10.1016\/j.jisa.2026.104460_bib0044","series-title":"Advances in cryptology-CRYPTO 2001: 21st annual international cryptology conference, santa barbara, california, USA, august 19\u201323, 2001 proceedings 21","first-page":"19","article-title":"Universally composable commitments","author":"Canetti","year":"2001"},{"key":"10.1016\/j.jisa.2026.104460_bib0045","series-title":"Proceedings of the 2017\u202fACM SIGSAC conference on computer and communications security","first-page":"1243","article-title":"Fast private set intersection from homomorphic encryption","author":"Chen","year":"2017"},{"key":"10.1016\/j.jisa.2026.104460_bib0046","series-title":"Proceedings of the 2017\u202fACM SIGSAC conference on computer and communications security","first-page":"1229","article-title":"Malicious-secure private set intersection via dual execution","author":"Rindal","year":"2017"}],"container-title":["Journal of Information Security and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2214212626000906?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2214212626000906?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T15:45:12Z","timestamp":1778859912000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2214212626000906"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":46,"alternative-id":["S2214212626000906"],"URL":"https:\/\/doi.org\/10.1016\/j.jisa.2026.104460","relation":{},"ISSN":["2214-2126"],"issn-type":[{"value":"2214-2126","type":"print"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Towards efficient malicious-secure multi-party private set union: Harnessing trusted execution environments","name":"articletitle","label":"Article Title"},{"value":"Journal of Information Security and Applications","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jisa.2026.104460","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"104460"}}