Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Advanced Quantum Technologies

A New Hybrid Protocol that Simultaneously Achieves Quantum Multiparty Summation and Ranking

Yu Zhang, Yao Yao, Huixin Sun, Kejia Zhang, Tingting Song

Published May 22, 2024• 10 citations
Publisher

Abstract

Abstract Secure multiparty quantum summation, as a critical part of secure multiparty quantum computation, plays a pivotal role in the field of quantum cryptography. In this paper, a hybrid protocol is proposed to implement secure multiparty quantum summation and anonymous ranking simultaneously, which uses ‐level two‐particle entangled states. In the designed protocol, the particles are conveyed in the way of the circle‐type transmission mode, which can compute the sum of the secret and the ranking by analyzing the distribution of participants associated with different secret values. Moreover, random number sequences can be obtained by constructing a fundamental system of solutions, which avoids the transmission of random numbers and reduces the use of quantum resources. According to the analysis, it can be seen that the protocol is secure against known attacks, and the secrets remain undisclosed throughout the protocol's implementation.

DOI
10.1002/qute.202400078

Related papers

Semi‐Quantum Secure Multiparty Summation and its Applications to Anonymous Auction and Ranking

Chong‐Qiang Ye, J. Li, Xiu‐Bo Chen +4 more

Abstract Semi‐quantum secure summation allows multiple parties with limited quantum capabilities to perform collective calculations under the premise of protecting privacy. However, current approaches are confined to low‐dimensional quantum states as information carriers and are restricted to scenarios involving two or three parties. This limitation hinders their universality and ability to fulfill the requirements of practical secure multiparty computations. To address these challenges, a novel semi‐quantum secure multiparty summation (SQSMS) protocol is proposed based on high‐dimensional entangled states and single‐particle states. The protocol leverages the entanglement correlation to guarantee the security of the transmission, enabling resistance against various potential attacks. Then, by utilizing the IBM Qiskit platform, corresponding quantum circuits and simulation results are presented to validate the feasibility and correctness of the protocol. Furthermore, building upon the foundation of the SQSMS protocol, semi‐quantum anonymous auction and anonymous ranking protocols are further constructed. Compared with previous approaches, the designed protocols cater to the requirements of their respective counterparts. Consequently, the approach may have broad applications in semi‐quantum secure multiparty computation scenarios.

Advanced Quantum Technologies•Jan 8, 2024•14 citations

General quantum secure multiparty computation protocol for simultaneous summation and multiplication

Feixiang Li, Mei Luo, Shixin Zhu +1 more

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.

Physica Scripta•Dec 5, 2023•8 citations

Hybrid Quantum Protocols for Secure Multiparty Summation and Multiplication

Kartick Sutradhar, Hari Om

The summation and multiplication are two basic operations for secure multiparty quantum computation. The existing secure multiparty quantum summation and multiplication protocols have (n, n) threshold approach and their computation type is bit-by-bit, where n is total number of players. In this paper, we propose two hybrid (t, n) threshold quantum protocols for secure multiparty summation and multiplication based on the Shamir's secret sharing, SUM gate, quantum fourier transform, and generalized Pauli operator, where t is a threshold number of players that can perform the summation and multiplication. Their computation type is secret-by-secret with modulo d, where d, n ≤ d ≤ 2n, is a prime. The proposed protocols can resist the intercept-resend, entangle-measure, collusion, collective, and coherent quantum attacks. They have better computation as well as communication costs and no player can get other player's private input.

Scientific Reports•Jun 4, 2020•57 citations

A quantum secure multi-party summation protocol based on one-direction quantum walks on a circle

Jin-Tao WANG, Xia Li, Tian-Yu Ye

This paper presents a novel quantum secure multi-party summation protocol based on one-direction quantum walks on a circle (ODQWC), which allows the summation computation of different integer sequences from “n” secret holders. Crucially, it ensures that this process does not infringe on the privacy of these secret holders by delivering quantum walk states in a circular pattern. Our proposed protocol employs two-particle product states rather than quantum entangled states as the initial quantum resource and eliminates the need for different secret holders to perform quantum entanglement swapping operations. Instead, it emphasizes imposing one-direction evolution operators on quantum walk states. Additionally, our protocol requires single-particle measurements. Security analysis validates that our proposed protocol can effectively counter external attacks and those initiated by participants. Under specific conditions, our proposed protocol can be adapted into a quantum secure multi-party bit summation protocol based on ODQWC.

Zhongguo kexue. Wulixue Lixue Tianwenxue•Feb 21, 2024•9 citations

Secure multiparty quantum computation based on Lagrange unitary operator

Xiuli Song, Rui Gou, Aijun Wen

As an important subtopic of classical cryptography, secure multiparty quantum computation allows multiple parties to jointly compute their private inputs without revealing them. Most existing secure multiparty computation protocols have the shortcomings of low computational efficiency and high resource consumption. To remedy these shortcomings, we propose a secure multiparty quantum computation protocol by using the Lagrange unitary operator and the Shamir (t, n) threshold secret sharing, in which the server generates all secret shares and distributes each secret share to the corresponding participant, in addition, he prepares a particle and sends it to the first participant. The first participant performs the Lagrange unitary operation on the received particle, and then sends the transformed particle to the next participant. Until the last participant's computation task is completed, the transformed particle is sent back to the server. The server performs Lagrange unitary operation on the received particle by using a secret message, and then measures the transformed particle to obtain the sum of the calculations of multiple participants. Security analysis shows that the proposed protocol can resist intercept-measurement attack, intercept-resend attack, entanglement-swapping attack, entanglement-measurement attack and collusion attack. Performance comparison shows that it has higher computation efficiency and lower resource consumption than other similar protocols.

Scientific Reports•May 13, 2020•6 citations

Implementing quantum anonymous multi-party ranking: the influence and application of the law of large numbers

Qingle Wang, Jiawei Liu, Guodong Li +2 more

Abstract Secure multi-party ranking is not only a pivotal component within the domain of secure multi-party computation but also holds extensive real-world applicability, given its efficacy in safeguarding the integrity and privacy of data. In this paper, we propose a verifiable quantum anonymous multi-party ranking protocol, which leverages the power of multi-particle entangled states in conjunction with the law of large numbers. The protocol achieves the secure ranking of participants’ private data while verifying their identities through the assistance of a semi-honest third party. We prove that the protocol is resistant to different types of attacks from internal or external attackers. In addition, the proposed protocol employs qubits as the information carriers, which improves the feasibility of the protocol. We demonstrate the feasibility of the protocol by using the online analog quantum computer of IBM Corporation placed on the cloud. Our research represents an innovative initiative that merges the realms of quantum cryptography and statistical analysis to address pertinent practical challenges.

Physica Scripta•Jan 30, 2024•1 citation
Abstract Secure multiparty quantum summation, as a critical part of secure multiparty quantum computation, plays a pivotal role in the field of quantum cryptography. In this paper, a hybrid protocol is proposed to implement secure multiparty quantum summation and anonymous ranking simultaneously, which uses ‐level two‐particle entangled states. In the designed protocol, the particles are conveyed in the way of the circle‐type transmission mode, which can compute the sum of the secret and the ranking by analyzing the distribution of participants associated with different secret values. Moreover, random number sequences can be obtained by constructing a fundamental system of solutions, which avoids the transmission of random numbers and reduces the use of quantum resources. According to the analysis, it can be seen that the protocol is secure against known attacks, and the secrets remain undisclosed throughout the protocol's implementation.
Abstract Semi‐quantum secure summation allows multiple parties with limited quantum capabilities to perform collective calculations under the premise of protecting privacy. However, current approaches are confined to low‐dimensional quantum states as information carriers and are restricted to scenarios involving two or three parties. This limitation hinders their universality and ability to fulfill the requirements of practical secure multiparty computations. To address these challenges, a novel semi‐quantum secure multiparty summation (SQSMS) protocol is proposed based on high‐dimensional entangled states and single‐particle states. The protocol leverages the entanglement correlation to guarantee the security of the transmission, enabling resistance against various potential attacks. Then, by utilizing the IBM Qiskit platform, corresponding quantum circuits and simulation results are presented to validate the feasibility and correctness of the protocol. Furthermore, building upon the foundation of the SQSMS protocol, semi‐quantum anonymous auction and anonymous ranking protocols are further constructed. Compared with previous approaches, the designed protocols cater to the requirements of their respective counterparts. Consequently, the approach may have broad applications in semi‐quantum secure multiparty computation scenarios.
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.
The summation and multiplication are two basic operations for secure multiparty quantum computation. The existing secure multiparty quantum summation and multiplication protocols have (n, n) threshold approach and their computation type is bit-by-bit, where n is total number of players. In this paper, we propose two hybrid (t, n) threshold quantum protocols for secure multiparty summation and multiplication based on the Shamir's secret sharing, SUM gate, quantum fourier transform, and generalized Pauli operator, where t is a threshold number of players that can perform the summation and multiplication. Their computation type is secret-by-secret with modulo d, where d, n ≤ d ≤ 2n, is a prime. The proposed protocols can resist the intercept-resend, entangle-measure, collusion, collective, and coherent quantum attacks. They have better computation as well as communication costs and no player can get other player's private input.
This paper presents a novel quantum secure multi-party summation protocol based on one-direction quantum walks on a circle (ODQWC), which allows the summation computation of different integer sequences from “n” secret holders. Crucially, it ensures that this process does not infringe on the privacy of these secret holders by delivering quantum walk states in a circular pattern. Our proposed protocol employs two-particle product states rather than quantum entangled states as the initial quantum resource and eliminates the need for different secret holders to perform quantum entanglement swapping operations. Instead, it emphasizes imposing one-direction evolution operators on quantum walk states. Additionally, our protocol requires single-particle measurements. Security analysis validates that our proposed protocol can effectively counter external attacks and those initiated by participants. Under specific conditions, our proposed protocol can be adapted into a quantum secure multi-party bit summation protocol based on ODQWC.
As an important subtopic of classical cryptography, secure multiparty quantum computation allows multiple parties to jointly compute their private inputs without revealing them. Most existing secure multiparty computation protocols have the shortcomings of low computational efficiency and high resource consumption. To remedy these shortcomings, we propose a secure multiparty quantum computation protocol by using the Lagrange unitary operator and the Shamir (t, n) threshold secret sharing, in which the server generates all secret shares and distributes each secret share to the corresponding participant, in addition, he prepares a particle and sends it to the first participant. The first participant performs the Lagrange unitary operation on the received particle, and then sends the transformed particle to the next participant. Until the last participant's computation task is completed, the transformed particle is sent back to the server. The server performs Lagrange unitary operation on the received particle by using a secret message, and then measures the transformed particle to obtain the sum of the calculations of multiple participants. Security analysis shows that the proposed protocol can resist intercept-measurement attack, intercept-resend attack, entanglement-swapping attack, entanglement-measurement attack and collusion attack. Performance comparison shows that it has higher computation efficiency and lower resource consumption than other similar protocols.
Abstract Secure multi-party ranking is not only a pivotal component within the domain of secure multi-party computation but also holds extensive real-world applicability, given its efficacy in safeguarding the integrity and privacy of data. In this paper, we propose a verifiable quantum anonymous multi-party ranking protocol, which leverages the power of multi-particle entangled states in conjunction with the law of large numbers. The protocol achieves the secure ranking of participants’ private data while verifying their identities through the assistance of a semi-honest third party. We prove that the protocol is resistant to different types of attacks from internal or external attackers. In addition, the proposed protocol employs qubits as the information carriers, which improves the feasibility of the protocol. We demonstrate the feasibility of the protocol by using the online analog quantum computer of IBM Corporation placed on the cloud. Our research represents an innovative initiative that merges the realms of quantum cryptography and statistical analysis to address pertinent practical challenges.