https://doi.org/10.1140/epjqt/s40507-025-00361-2
Research
A novel quantum multiparty summation protocol based on a cooperative random number mechanism
1
School of Computer Science and Big Data (School of Cybersecurity), Heilongjiang University, Xuefu, 150080, Harbin, Asia, China
2
State Key Laboratory of Public Big Data, Guizhou University, Huaxi, 550000, Guiyang, Asia, China
3
School of Mathematical Science, Heilongjiang University, Xuefu, 150080, Harbin, Asia, China
4
College of Information Science and Technology, Jinan University, 510632, Guangzhou, Asia, China
5
Institute for Cryptology and Network Security, Heilongjiang University, Xuefu, 150080, Harbin, Asia, China
6
School of China Construction Bank, University Northeastern Institute, Harbin, China
a
tingtingsong@jnu.edu.cn
b
dugang@hlju.edu.cn
Received:
18
January
2025
Accepted:
5
May
2025
Published online:
22
May
2025
As a particular area of quantum security multiparty computation, quantum secure multiparty summation plays a critical role in modern cryptography. It is widely known that most of the existing quantum summation protocols are based on an honest or semi-honest third party (TP). However, the introduced TP makes the protocol difficult to implement in practice, as it may face a single-point-of-failure attack on TP. Although some TP-free protocols are proposed to mitigate this risk, the increased cost of communication reduces its efficiency. To address these issues, a novel quantum-secure multiparty summation protocol based on a cooperative random number distribution mechanism (QMS-CRM) is proposed in this paper for the first time. During it, this mechanism is designed using Shamir’s secret sharing scheme. Furthermore, this approach eliminates the requirement for random number exchange between participants without the help of TP, enhancing the efficiency of the protocol. The security analysis demonstrates that the proposed protocol can resist both external attacks and collusion attacks by up to 
participants. Finally, we simulated the protocol on the IBM Quantum Cloud platform, confirming its feasibility.
Key words: Secure multi-party computation / Quantum secure multi-party summation / Quantum cryptography / Shamir’s secret sharing scheme
© The Author(s) 2025
Open Access This article is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License, which permits any non-commercial use, sharing, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if you modified the licensed material. You do not have permission under this licence to share adapted material derived from this article or parts of it. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by-nc-nd/4.0/.
