{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T15:06:02Z","timestamp":1782399962787,"version":"3.54.5"},"reference-count":35,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T00:00:00Z","timestamp":1744848000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Natural Science Foundation of Shanghai","award":["22ZR1427100"],"award-info":[{"award-number":["22ZR1427100"]}]},{"name":"Natural Science Foundation of Shanghai","award":["61972241"],"award-info":[{"award-number":["61972241"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["22ZR1427100"],"award-info":[{"award-number":["22ZR1427100"]}],"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"}]},{"name":"the Fishery Engineering and Equipment Innovation Team of Shanghai High-level Local University","award":["22ZR1427100"],"award-info":[{"award-number":["22ZR1427100"]}]},{"name":"the Fishery Engineering and Equipment Innovation Team of Shanghai High-level Local University","award":["61972241"],"award-info":[{"award-number":["61972241"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cryptography"],"abstract":"<jats:p>Threshold Multi-Party Private Set Intersection (TMP-PSI) is a cryptographic protocol that enables an element from the receiver\u2019s set to be included in the intersection result if it appears in the sets of at least t\u22121 other participants, where t represents the threshold. This protocol is crucial for a variety of applications, such as anonymous electronic voting, online ride-sharing, and close-contact tracing programs. However, most existing TMP-PSI schemes are designed based on threshold homomorphic encryption, which faces significant challenges, including low computational efficiency and a high number of communication rounds. To overcome these limitations, this study introduces the Threshold Oblivious Pseudo-Random Function (tOPRF) to fulfill the requirements of threshold encryption and decryption. Additionally, we extend the concept of the Oblivious Programmable Pseudo-Random Function (OPPRF) to develop a novel cryptographic primitive termed the Partially OPPRF (P-OPPRF). This new primitive retains the critical properties of obliviousness and randomness, along with the security assurances inherited from the OPPRF, while also offering strong resistance against malicious adversaries. Leveraging this primitive, we propose the first malicious-secure TMP-PSI protocol, named QMP-PSI, specifically designed for applications like anonymous electronic voting systems. The protocol effectively counters collusion attacks among multiple parties, ensuring robust security in multi-party environments. To further enhance voting efficiency, this work presents a cloud-assisted QMP-PSI to outsource the computationally intensive phases. This ensures that the computational overhead for participants is solely dependent on the set size and statistical security parameters, thereby maintaining security while significantly reducing the computational burden on voting participants. Finally, this work validates the protocol\u2019s performance through extensive experiments under various set sizes, participant numbers, and threshold values. The results demonstrate that the protocol surpasses existing schemes, achieving state-of-the-art (SOTA) performance in communication overhead. Notably, in small-scale voting scenarios, it exhibits exceptional performance, particularly when the threshold is small or close to the number of participants.<\/jats:p>","DOI":"10.3390\/cryptography9020023","type":"journal-article","created":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T20:05:56Z","timestamp":1744920356000},"page":"23","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Malicious-Secure Threshold Multi-Party Private Set Intersection for Anonymous Electronic Voting"],"prefix":"10.3390","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-6499-1458","authenticated-orcid":false,"given":"Xiansong","family":"Qian","sequence":"first","affiliation":[{"name":"College of Information, Shanghai Ocean University, Shanghai 201306, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0243-9995","authenticated-orcid":false,"given":"Lifei","family":"Wei","sequence":"additional","affiliation":[{"name":"College of Information Engineering, Shanghai Maritime University, Shanghai 201306, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2339-2356","authenticated-orcid":false,"given":"Jinjiao","family":"Zhang","sequence":"additional","affiliation":[{"name":"College of Information Engineering, Shanghai Maritime University, Shanghai 201306, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1458-2297","authenticated-orcid":false,"given":"Lei","family":"Zhang","sequence":"additional","affiliation":[{"name":"College of Information, Shanghai Ocean University, Shanghai 201306, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2025,4,17]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Chase, M., and Miao, P. (2020, January 17\u201321). Private set intersection in the internet setting from lightweight oblivious PRF. Proceedings of the 40th Annual International Cryptology Conference, Santa Barbara, CA, USA.","DOI":"10.1007\/978-3-030-56877-1_2"},{"key":"ref_2","first-page":"1859","article-title":"A Survey of Multi-party Private Set Intersection","volume":"45","author":"Ying","year":"2023","journal-title":"J. Electron. Inf. Technol."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"2031","DOI":"10.1109\/COMST.2020.2986024","article-title":"Federated learning in mobile edge networks: A comprehensive survey","volume":"22","author":"Lim","year":"2020","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"ref_4","unstructured":"Pinkas, B., Schneider, T., and Zohner, M. (2014, January 20\u201322). Faster private set intersection based on OT extension. Proceedings of the 23rd USENIX Security Symposium (USENIX Security 14), San Diego, CA, USA."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Kolesnikov, V., Kumaresan, R., Rosulek, M., and Trieu, N. (2016, January 24\u201328). Efficient batched oblivious PRF with applications to private set intersection. Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, Vienna, Austria.","DOI":"10.1145\/2976749.2978381"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Chen, H., Laine, K., and Rindal, P. (November, January 30). Fast private set intersection from homomorphic encryption. Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, Dallas, TX, USA.","DOI":"10.1145\/3133956.3134061"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Chen, H., Huang, Z., Laine, K., and Rindal, P. (2018, January 15\u201319). Labeled PSI from fully homomorphic encryption with malicious security. Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, Toronto, ON, Canada.","DOI":"10.1145\/3243734.3243836"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Rindal, P., and Schoppmann, P. (2021, January 17\u201321). VOLE-PSI: Fast OPRF and circuit-PSI from vector-OLE. Proceedings of the 40th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia.","DOI":"10.1007\/978-3-030-77886-6_31"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Raghuraman, S., and Rindal, P. (2022, January 7\u201311). Blazing fast PSI from improved OKVS and subfield VOLE. Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, Los Angeles, CA, USA.","DOI":"10.1145\/3548606.3560658"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Kolesnikov, V., Matania, N., Pinkas, B., Rosulek, M., and Trieu, N. (November, January 30). Practical multi-party private set intersection from symmetric-key techniques. Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, Dallas, TX, USA.","DOI":"10.1145\/3133956.3134065"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Gao, J., Trieu, N., and Yanai, A. (2024, January 15\u201320). Multiparty private set intersection cardinality and its applications. Proceedings of the 24th Privacy Enhancing Technologies Symposium (PETS 2024), Bristol, UK.","DOI":"10.56553\/popets-2024-0041"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"103764","DOI":"10.1016\/j.csi.2023.103764","article-title":"Efficient multi-party private set intersection protocols for large participants and small sets","volume":"87","author":"Wei","year":"2024","journal-title":"Comput. Stand. Interfaces"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Nevo, O., Trieu, N., and Yanai, A. (2021, January 15\u201319). Simple, fast malicious multiparty private set intersection. Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security, Online.","DOI":"10.1145\/3460120.3484772"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"16585","DOI":"10.1109\/JIOT.2021.3074877","article-title":"d-BAME: Distributed blockchain-based anonymous mobile electronic voting","volume":"8","author":"Zaghloul","year":"2021","journal-title":"IEEE Internet Things J."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Jafar, U., Aziz, M.J.A., and Shukur, Z. (2021). Blockchain for electronic voting system\u2014review and open research challenges. Sensors, 21.","DOI":"10.3390\/s21175874"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"3808","DOI":"10.1109\/TNSE.2022.3190909","article-title":"A blockchain-based self-tallying voting protocol with maximum voter privacy","volume":"9","author":"Huang","year":"2022","journal-title":"IEEE Trans. Netw. Sci. Eng."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TIFS.2021.3118879","article-title":"Practical Multi-Party Private Set Intersection Protocols","volume":"17","author":"Bay","year":"2022","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"6184","DOI":"10.1109\/TIFS.2024.3402355","article-title":"Enabling Threshold Functionality for Private Set Intersection Protocols in Cloud Computing","volume":"19","author":"Hu","year":"2024","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Chandran, N., Dasgupta, N., Gupta, D., Obbattu, S.L.B., Sekar, S., and Shah, A. (2021, January 15\u201319). Efficient Linear Multiparty PSI and Extensions to Circuit\/Quorum PSI. Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event.","DOI":"10.1145\/3460120.3484591"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Mahdavi, R.A., Humphries, T., Kacsmar, B., Krastnikov, S., Lukas, N., Premkumar, J.A., Shafieinejad, M., Oya, S., Kerschbaum, F., and Blass, E.O. (2020, January 7\u201311). Practical over-threshold multi-party private set intersection. Proceedings of the 36th Annual Computer Security Applications Conference, Austin, TX, USA.","DOI":"10.1145\/3427228.3427267"},{"key":"ref_21","unstructured":"Branco, P., D\u00f6ttling, N., and Pu, S. (2025, April 14). Multiparty Cardinality Testing for Threshold Private Set Intersection. Cryptology ePrint Archive, Paper 2020\/1307. Available online: https:\/\/eprint.iacr.org\/2020\/1307."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Ghosh, S., and Simkin, M. (2019, January 18\u201322). The Communication Complexity of Threshold Private Set Intersection. Proceedings of the 39th Annual International Cryptology Conference, Santa Barbara, CA, USA.","DOI":"10.1007\/978-3-030-26951-7_1"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Ghosh, S., and Simkin, M. (2023, January 7\u201310). Threshold private set intersection with better communication complexity. Proceedings of the 26th IACR International Conference on Practice and Theory of Public-Key Cryptography, Atlanta, GA, USA.","DOI":"10.1007\/978-3-031-31371-4_9"},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Liu, F.H., Zhang, E., and Qin, L. (2023, January 26\u201330). Efficient Multiparty Probabilistic Threshold Private Set Intersection. Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, Copenhagen, Denmark.","DOI":"10.1145\/3576915.3623158"},{"key":"ref_25","first-page":"5442","article-title":"Two Cloud-assisted Over-threshold Multi-party Private Set Intersection Calculation Protocol","volume":"34","author":"Wei","year":"2023","journal-title":"J. Softw."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","article-title":"How to share a secret","volume":"22","author":"Shamir","year":"1979","journal-title":"Commun. ACM"},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Jarecki, S., Kiayias, A., Krawczyk, H., and Xu, J. (2017, January 10\u201312). TOPPSS: Cost-minimal Password-Protected Secret Sharing based on Threshold OPRF. Proceedings of the 15th International Conference, ACNS 2017, Kanazawa, Japan.","DOI":"10.1007\/978-3-319-61204-1_3"},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Gu, Y., Jarecki, S., Kedzior, P., Nazarian, P., and Xu, J. (2024, January 9\u201313). Threshold PAKE with Security against Compromise of all Servers. Proceedings of the 30th International Conference on the Theory and Application of Cryptology and Information Security, Kolkata, India.","DOI":"10.1007\/978-981-96-0935-2_3"},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Pinkas, B., Rosulek, M., Trieu, N., and Yanai, A. (2020, January 10\u201314). PSI from PaXoS: Fast, Malicious Private Set Intersection. Proceedings of the 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia.","DOI":"10.1007\/978-3-030-45724-2_25"},{"key":"ref_30","unstructured":"Zhang, C., Chen, Y., Liu, W., Zhang, M., and Lin, D. (2023, January 9\u201311). Linear Private Set Union from Multi-Query Reverse Private Membership Test. Proceedings of the 32nd USENIX Security Symposium (USENIX Security 23), Anaheim, CA, USA."},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Zhang, C., Chen, Y., Liu, W., Peng, L., Hao, M., Wang, A., and Wang, X. (2024, January 14\u201318). Unbalanced private set union with reduced computation and communication. Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, Salt Lake City, UT, USA.","DOI":"10.1145\/3658644.3690308"},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Dong, C., Chen, L., and Wen, Z. (2013, January 4\u20138). When private set intersection meets big data: An efficient and scalable protocol. Proceedings of the 2013 ACM SIGSAC Conference on Computer & Communications Security, Berlin, Germany.","DOI":"10.1145\/2508859.2516701"},{"key":"ref_33","unstructured":"Bienstock, A., Patel, S., Seo, J.Y., and Yeo, K. (2023, January 9\u201311). Near-Optimal Oblivious Key-Value Stores for Efficient PSI, PSU and Volume-Hiding Multi-Maps. Proceedings of the 32nd USENIX Security Symposium (USENIX Security 23), Anaheim, CA, USA."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1109\/SURV.2011.031611.00024","article-title":"Theory and Practice of Bloom Filters for Distributed Systems","volume":"14","author":"Tarkoma","year":"2012","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"ref_35","unstructured":"Denis, F. (2025, April 14). The Sodium Cryptography Library. Available online: https:\/\/download.libsodium.org\/doc\/."}],"container-title":["Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2410-387X\/9\/2\/23\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T17:16:49Z","timestamp":1760030209000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2410-387X\/9\/2\/23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,17]]},"references-count":35,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2025,6]]}},"alternative-id":["cryptography9020023"],"URL":"https:\/\/doi.org\/10.3390\/cryptography9020023","relation":{},"ISSN":["2410-387X"],"issn-type":[{"value":"2410-387X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,4,17]]}}}