Quantum secure multi-party summation (QSMS) is a fundamental problem in quantum secure multi-party computation (QSMC), wherein multiple parties compute the sum of their data without revealing them. This paper proposes a novel QSMS protocol based on graph state, which offers enhanced security, usability, and flexibility compared to existing methods. The protocol leverages the structural advantages of graph state and employs random graph state structures and random encryption gate operations to provide stronger security. Additionally, the stabilizer of the graph state is utilized to detect eavesdroppers and channel noise without the need for decoy bits. The protocol allows for the arbitrary addition and deletion of participants, enabling greater flexibility. Experimental verification is conducted to demonstrate the security, effectiveness, and practicality of the proposed protocols. The correctness and security of the protocols are formally proven. The QSMS method based on graph state introduces new opportunities for QSMC. It highlights the potential of leveraging quantum graph state technology to securely and efficiently solve various multi-party computation problems.
Quantum secure multi-party summation (QSMS) is a fundamental problem in quantum secure multi-party computation (QSMC), wherein multiple parties compute the sum of their data without revealing them. This paper proposes a novel QSMS protocol based on graph state, which offers enhanced security, usability, and flexibility compared to existing methods. The protocol leverages the structural advantages of graph state and employs random graph state structures and random encryption gate operations to provide stronger security. Additionally, the stabilizer of the graph state is utilized to detect eavesdroppers and channel noise without the need for decoy bits. The protocol allows for the arbitrary addition and deletion of participants, enabling greater flexibility. Experimental verification is conducted to demonstrate the security, effectiveness, and practicality of the proposed protocols. The correctness and security of the protocols are formally proven. The QSMS method based on graph state introduces new opportunities for QSMC. It highlights the potential of leveraging quantum graph state technology to securely and efficiently solve various multi-party computation problems.
Quantum Secure Multi-party Summation (QSMS) is a fundamental primitive of Quantum Secure Multi-party Computation (QSMC), enabling multiple participants to jointly compute the sum of their private inputs without disclosing individual data. However, most existing QSMS protocols require all participants to possess full quantum capabilities and often rely on pre-shared keys, auxiliary mask transmission, or multiple trusted third parties, resulting in high communication overhead and limited practicality. To address these limitations, we propose an efficient Semi-Quantum Secure Multi-party Summation (SQSMS) protocol based on d-dimensional n-particle entangled states. By exploiting the global correlation properties of high-dimensional entangled states, the proposed protocol generates correlated random masks directly from quantum measurement outcomes. These masks cancel automatically during the aggregation process, eliminating the need for additional mask distribution and transmission. Compared with existing QSMS schemes, the proposed protocol reduces communication overhead, improves quantum efficiency, and avoids reliance on pre-shared keys or multiple trusted third parties. Moreover, only simple measurement operations are required from classical participants, making the protocol more practical for semi-quantum environments. We further provide formal correctness and security analyses of the proposed protocol and conduct quantum circuit simulations using the IBM Qiskit platform to demonstrate its feasibility. Moreover, based on the proposed summation protocol, we design several extended application protocols, including anonymous voting, anonymous auction, and anonymous ranking, which further illustrate the scalability and practical applicability of the proposed scheme.
Abstract Secure Multiparty Computation (MPC) is a cryptography technique that allows multiple parties to securely perform operations on their private inputs without revealing them. It is used in various applications, such as data aggregation in the cloud, IoT, etc., where data privacy is the prime concern. Many researchers have explored ways to develop secure protocols with minimal risk of data leakage. Many of these classical secure MPC protocols depend on classical random number generators. However, advances in quantum information processing are putting classical key distribution methods at risk. Traditional summation protocols adopt an ((n,n)) threshold approach, requiring the participation of all (n) players to compute the sum securely. However, the proposed quantum secure multiparty computation based on secure summation and QKD (QSMPC-SSQKD) introduces a generalised quantum secure multiparty summation protocol. The proposed protocol utilises entanglement, a fundamental property of quantum mechanics, to facilitate safe key exchange, thereby ensuring robust security measures. We use a quantum random number generator (QRNG) to generate true random numbers, ensuring privacy preservation. The protocol achieves a per-bit entropy level of 0.708 through QRNG, which provides strong randomness. The security of the proposed protocol is validated using the CHSCH test ((B≈2.8)), ensuring that any attempt to eavesdrop on the system can be detected, and the complete process will be rescheduled. Compared to some similar protocols, the proposed QSMPC-SSQKD protocol provides higher randomness and lower quantum circuit cost without using any trusted third party (TTP). This improvement enhances the protocol’s efficiency and practicality in preventing data leakage during computation.
Secure multi-party computation has been playing a fundamental role in terms of classical cryptography. Quantum homomorphic encryption (QHE) could compute the encrypted data without decryption. At present, most protocols use a semi-honest third party (TP) to protect participants’ secrets. We use a quantum homomorphic encryption scheme instead of TP to protect the privacy of parties. Based on quantum homomorphic encryption, a secure multi-party quantum summation scheme is proposed in which N participants can delegate a server with strong quantum computing power to assist computation. By delegating the computation and key update processes to a server and a semi-honest key center, participants encrypt their private information data using Pauli operators to get the sum. Besides, the server can design and optimize the summation lines itself, and the correct results can be obtained even if the secret information is negative. The correctness analysis showed that the participants could correctly obtain the results of the calculation. The security analysis proves the scheme is resistant to both outside attack and participant’s attack, and is secure against collusive attack by up to N-2 participants. From the theoretical point of view, our protocol can extend to other secure multi-party computing problems.
Abstract Quantum secure multiparty computation occupies an important place in quantum cryptography. Based on access structure and linear secret sharing, we propose a new general quantum secure multiparty computation protocol for simultaneous summation and multiplication in a high-dimensional quantum system. In our protocol, each participant within any authorized sets only needs to perform local Pauli operation once on the generalized Bell state, then the summation and multiplication results can be output simultaneously, which improves the practicality of the protocol. Moreover, in the privacy computation phase, the decoy particle detection technique as well as the addition of random numbers are applied to blind the privacy information, making our protocol higher privacy protection. Security analysis shows that our protocol is resistant to a series of typical external attacks and dishonest internal participant attacks such as individual attack and collusion attack. Finally, compared with the existing protocols, our protocol not only has higher efficiency but also lower consumption.
Abstract Quantum secure multi-party computation (SMC) is a vital field in quantum cryptography. In this paper, we try to resolve SMC problems universally via graph states. Firstly, three kinds of quantum SMC protocols are investigated, which are quantum private comparison protocol, quantum millionaire protocol and quantum multi-party summation protocol. Secondly, three proposed protocols are reviewed, and then the core of them is summarized. We further find that the computation, deduced as modulo subtraction, can be resolved by using graph state. This implies that our protocols are universal in part and will be widely applicable. Thirdly, analyses show that the proposed protocols are correct and secure. Our research will promote the development of quantum secure multi-party computation.
Abstract Secure multi-party computational geometry is a branch of secure multi-party computation, which is applied in many important fields. But up to now, the research on how to solve this problem with quantum methods has just started. Therefore, we study the design of quantum secure multi-party computational geometry (QSMCG) protocols in this paper. As the foundation, we extend the two-party summation and multiplication protocols proposed by Sutradhar and Om to multi-party protocols. Then we propose three new QSMCG protocols. Our proposed quantum secure two-party distance computation protocol has improvement in efficiency and accuracy. And the proposed quantum secure multi-party polytope volume computation protocol as well as the quantum secure circle–circle intersection area computation protocol are designed for the first time. Moreover, these protocols are designed to use multi-third parties, which solves the problem of intermediate value leakage in computation. The correctness, security and performance of all these protocols are analyzed.