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

International Journal of Quantum Information

Multi-party quantum summation without a trusted third party based on single particles

Cai Zhang, Haozhen Situ, Qiong Huang, Pingle Yang

Published Feb 3, 2017• 48 citations
Publisher

Abstract

We propose multi-party quantum summation protocols based on single particles, in which participants are allowed to compute the summation of their inputs without the help of a trusted third party and preserve the privacy of their inputs. Only one participant who generates the source particles needs to perform unitary operations and only single particles are needed in the beginning of the protocols.

DOI
10.1142/s0219749917500101

Related papers

Three-party quantum summation without a trusted third party

Cai Zhang, Zhiwei Sun, Xiang Huang +1 more

In this paper, we propose a quantum summation protocol, in which the genuinely maximally entangled six-qubit states found by Borras et al., are employed. Because of the excellent properties of the genuinely maximally entangled six-qubit states, the presented protocol allows three participants to compute the summation of their inputs without the help of a trusted third party and preserve the privacy of their inputs, respectively. The participants do not need any unitary operations. In addition, the proposed protocol utilizes the one-step quantum transmission and therefore is congenitally free from Trojan horse attacks. We have also shown that our protocol is secure against other well-known attacks over lossy and noisy quantum channels.

International Journal of Quantum Information•Mar 1, 2015•57 citations

A quantum secure multi-party summation protocol with quantum Fourier transform

Hong-Ming Pan

In this paper, a quantum secure multi-party summation scheme with a third party based on quantum Fourier transform (QFT) is put forward, where the third party cannot be permitted to cooperate with others but is allowed for all kinds of attacks. Under the help of third party, [Formula: see text] users can calculate the addition modulo [Formula: see text] of their private integer strings. The third party generates two-level single qubit and its product state as the initial quantum resource, produces the traveling particles with QFT and the controlled-not (CNOT) operations, and sends the traveling particles out to the first users; then, [Formula: see text] users encode their private integer sequences by performing the phase shifting operations on the travelling particles one after another; and finally, the third party decodes out the summation of the private integer sequences from [Formula: see text] users through CNOT operations and inverse quantum Fourier transform (IQFT). This protocol only adopts two-level single particle state and its product state as initial quantum resource, only needs [Formula: see text]-level single particle measurement and does not need to perform quantum entanglement swapping. Security analysis indicates that this protocol can overcome not only the outside attack but also the participant attack.

International Journal of Quantum Information•Jun 8, 2024•0 citations

Multi-Party Quantum Summation Based on Quantum Teleportation

Cai Zhang, Mohsen Razavi, Zhiwei Sun +2 more

We present a secure multi-party quantum summation protocol based on quantum teleportation, in which a malicious, but non-collusive, third party (TP) helps compute the summation. In our protocol, TP is in charge of entanglement distribution and Bell states are shared between participants. Users encode the qubits in their hand according to their private bits and perform Bell-state measurements. After obtaining participants' measurement results, TP can figure out the summation. The participants do not need to send their encoded states to others, and the protocol is therefore congenitally free from Trojan horse attacks. In addition, our protocol can be made secure against loss errors, because the entanglement distribution occurs only once at the beginning of our protocol. We show that our protocol is secure against attacks by the participants as well as the outsiders.

arXiv:1907.04438•Entropy•Jul 23, 2019•13 citations

Quantum Secure Multi-Party Summation Using Single Photons

Wanqing Wu, Ming-Zhe Xie

participants can simultaneously obtain the summation result without revealing their secret inputs. Our protocol uses single photon states as the information carriers. In addition, each participant with secret input only performs simple single-particle operators rather than particle preparation and any complex quantum measurements. These features make our protocol more feasible to implement. We demonstrate the correctness and security of the proposed protocol, which is resistant to participant attack and outside attack. In the end, we compare in detail the performance of the quantum summation protocol in this paper with other schemes in terms of different indicators. By comparison, our protocol is efficient and easy to implement.

Entropy•Mar 30, 2023•14 citations

Secure Multi-Party Quantum Summation Based on Quantum Homomorphic Encryption

Gang Xu, Fan Yun, Xiu‐Bo Chen +5 more

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.

Intelligent Automation & Soft Computing•Jan 1, 2022•17 citations

Multiparty private summation protocol based on two-state quantum-mechanical system

Jason Lin, Shao-Lun Huang, Chun‐Wei Yang +1 more

With the rapid advancement of information technology, data sharing has become increasingly accessible, leading to a heightened need for robust personal data protection. One important application in privacy-preserving computing is the aggregation of information when collaboratively establishing AI models through public distributed networks. To counter the threat posed by quantum computing to encrypted data, various quantum private summation (QPS) protocols have been proposed thus far. However, some of these existing protocols operate solely under modulo 2, while other approaches for modulo d often rely on impractically high-dimensional qudits. Therefore, this study proposes an innovative multiparty QPS method that balances participant data sharing and privacy without requiring high-dimensional photons. The proposed QPS protocol enables participants to contribute aggregated information to third parties without disclosing individual data. A security analysis further demonstrates that the proposed QPS effectively counters common eavesdropping attacks, ensuring reliable protection of personal data.

Scientific Reports•Jul 2, 2025•2 citations
We propose multi-party quantum summation protocols based on single particles, in which participants are allowed to compute the summation of their inputs without the help of a trusted third party and preserve the privacy of their inputs. Only one participant who generates the source particles needs to perform unitary operations and only single particles are needed in the beginning of the protocols.
In this paper, we propose a quantum summation protocol, in which the genuinely maximally entangled six-qubit states found by Borras et al., are employed. Because of the excellent properties of the genuinely maximally entangled six-qubit states, the presented protocol allows three participants to compute the summation of their inputs without the help of a trusted third party and preserve the privacy of their inputs, respectively. The participants do not need any unitary operations. In addition, the proposed protocol utilizes the one-step quantum transmission and therefore is congenitally free from Trojan horse attacks. We have also shown that our protocol is secure against other well-known attacks over lossy and noisy quantum channels.
In this paper, a quantum secure multi-party summation scheme with a third party based on quantum Fourier transform (QFT) is put forward, where the third party cannot be permitted to cooperate with others but is allowed for all kinds of attacks. Under the help of third party, [Formula: see text] users can calculate the addition modulo [Formula: see text] of their private integer strings. The third party generates two-level single qubit and its product state as the initial quantum resource, produces the traveling particles with QFT and the controlled-not (CNOT) operations, and sends the traveling particles out to the first users; then, [Formula: see text] users encode their private integer sequences by performing the phase shifting operations on the travelling particles one after another; and finally, the third party decodes out the summation of the private integer sequences from [Formula: see text] users through CNOT operations and inverse quantum Fourier transform (IQFT). This protocol only adopts two-level single particle state and its product state as initial quantum resource, only needs [Formula: see text]-level single particle measurement and does not need to perform quantum entanglement swapping. Security analysis indicates that this protocol can overcome not only the outside attack but also the participant attack.
We present a secure multi-party quantum summation protocol based on quantum teleportation, in which a malicious, but non-collusive, third party (TP) helps compute the summation. In our protocol, TP is in charge of entanglement distribution and Bell states are shared between participants. Users encode the qubits in their hand according to their private bits and perform Bell-state measurements. After obtaining participants' measurement results, TP can figure out the summation. The participants do not need to send their encoded states to others, and the protocol is therefore congenitally free from Trojan horse attacks. In addition, our protocol can be made secure against loss errors, because the entanglement distribution occurs only once at the beginning of our protocol. We show that our protocol is secure against attacks by the participants as well as the outsiders.
participants can simultaneously obtain the summation result without revealing their secret inputs. Our protocol uses single photon states as the information carriers. In addition, each participant with secret input only performs simple single-particle operators rather than particle preparation and any complex quantum measurements. These features make our protocol more feasible to implement. We demonstrate the correctness and security of the proposed protocol, which is resistant to participant attack and outside attack. In the end, we compare in detail the performance of the quantum summation protocol in this paper with other schemes in terms of different indicators. By comparison, our protocol is efficient and easy to implement.
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.
With the rapid advancement of information technology, data sharing has become increasingly accessible, leading to a heightened need for robust personal data protection. One important application in privacy-preserving computing is the aggregation of information when collaboratively establishing AI models through public distributed networks. To counter the threat posed by quantum computing to encrypted data, various quantum private summation (QPS) protocols have been proposed thus far. However, some of these existing protocols operate solely under modulo 2, while other approaches for modulo d often rely on impractically high-dimensional qudits. Therefore, this study proposes an innovative multiparty QPS method that balances participant data sharing and privacy without requiring high-dimensional photons. The proposed QPS protocol enables participants to contribute aggregated information to third parties without disclosing individual data. A security analysis further demonstrates that the proposed QPS effectively counters common eavesdropping attacks, ensuring reliable protection of personal data.