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

Entropy

Quantum Secure Multi-Party Summation Using Single Photons

Wanqing Wu, Ming-Zhe Xie

Published Mar 30, 2023• 13 citations
Publisher

Abstract

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.

DOI
10.3390/e25040590

Related papers

Different secure semi-quantum summation models without measurement

Yuan Tian, Nanyijia Zhang, Chong‐Qiang Ye +2 more

Abstract Secure semi-quantum summation entails the collective computation of the sum of private secrets by multi-untrustworthy and resource-limited participants, facilitated by a quantum third-party. This paper introduces three semi-quantum summation protocols based on single photons, where eliminating the need for classical users to possess measurement capabilities. Two-party protocol 1 and protocol 2 are structured upon different models: star and ring, respectively. The security analysis extensively evaluates the protocols' resilience against outside and inside attacks, demonstrating protocols are asymptotically secure. Protocol 3 extends two-party protocol 1 to multi-party scenarios, broadening its applicability. Comparison reveals a reduction in the workload for classical users compared to previous similar protocols, and the protocols' correctness are visually validated through simulation by Qiskit.

EPJ Quantum Technology•May 22, 2024•14 citations

Quantum Secure Multi-Party Summation with Identity Authentication Based on Commutative Encryption

Ning Wang, Xinying Tian, Xiaodong Zhang +1 more

In quantum secure multi-party summation protocols, some attackers can impersonate legitimate participants in the summation process, and easily steal the summation results from the participants. This is often overlooked for existing secure multi-party summation protocols, thus rendering them insecure. Based on commutative encryption, a quantum secure multi-party summation protocol with identity authentication is proposed in this paper. In the protocol, each participant encodes a secret integer on photons via unitary operations. At the same time, a one-way hash function technique with a key is utilized to perform identity authentication operations for each participant. Finally, the summation is calculated with the help of a semi-trusted third party. The analysis of the protocol shows that the proposed protocol is correct and resistant to common and impersonation attacks. Compared to related protocols, the use and measurement of single photons makes the protocol easier to implement into existing technology. Furthermore, the simulation experiments on the IBM Q Experience cloud platform demonstrate the effectiveness of the presented protocol.

Photonics•May 10, 2023•4 citations

Cryptanalysis and improvement of quantum secure multi-party summation using single photons

Chia‐Wei Tsai, Jason Lin, Chun‐Wei Yang

Abstract A previous study [Entropy 25.4 (2023): 590] proposed a quantum secure multi-party summation protocol wherein n participants could obtain the modulo-2 summation result using single photons and single-particle operations. Owing to the absence of an entanglement state, this protocol was more practical than other quantum summation protocols that used entanglement properties. Thus, this study investigated the claim that this proposed protocol prevented the participants’ secret inputs from being disclosed. It was found that the previously proposed protocol was vulnerable to a quantum Trojan horse attack owing to the circular qubit transmission mode. Using a security loophole, this study proposed an attack strategy that allowed an outside attacker to steal any participant’s secret input without being detected by a third party and participants. In addition, a simulation experiment was conducted to demonstrate the feasibility of the proposed attack and evaluate the number of quantum Trojan horse probes that the attacker must inject into regular qubit sequences. Finally, a solution was proposed by modifying the protocol to securely prevent quantum Trojan horse attacks.

Physica Scripta•Feb 7, 2024•2 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

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

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•12 citations
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.
Abstract Secure semi-quantum summation entails the collective computation of the sum of private secrets by multi-untrustworthy and resource-limited participants, facilitated by a quantum third-party. This paper introduces three semi-quantum summation protocols based on single photons, where eliminating the need for classical users to possess measurement capabilities. Two-party protocol 1 and protocol 2 are structured upon different models: star and ring, respectively. The security analysis extensively evaluates the protocols' resilience against outside and inside attacks, demonstrating protocols are asymptotically secure. Protocol 3 extends two-party protocol 1 to multi-party scenarios, broadening its applicability. Comparison reveals a reduction in the workload for classical users compared to previous similar protocols, and the protocols' correctness are visually validated through simulation by Qiskit.
In quantum secure multi-party summation protocols, some attackers can impersonate legitimate participants in the summation process, and easily steal the summation results from the participants. This is often overlooked for existing secure multi-party summation protocols, thus rendering them insecure. Based on commutative encryption, a quantum secure multi-party summation protocol with identity authentication is proposed in this paper. In the protocol, each participant encodes a secret integer on photons via unitary operations. At the same time, a one-way hash function technique with a key is utilized to perform identity authentication operations for each participant. Finally, the summation is calculated with the help of a semi-trusted third party. The analysis of the protocol shows that the proposed protocol is correct and resistant to common and impersonation attacks. Compared to related protocols, the use and measurement of single photons makes the protocol easier to implement into existing technology. Furthermore, the simulation experiments on the IBM Q Experience cloud platform demonstrate the effectiveness of the presented protocol.
Abstract A previous study [Entropy 25.4 (2023): 590] proposed a quantum secure multi-party summation protocol wherein n participants could obtain the modulo-2 summation result using single photons and single-particle operations. Owing to the absence of an entanglement state, this protocol was more practical than other quantum summation protocols that used entanglement properties. Thus, this study investigated the claim that this proposed protocol prevented the participants’ secret inputs from being disclosed. It was found that the previously proposed protocol was vulnerable to a quantum Trojan horse attack owing to the circular qubit transmission mode. Using a security loophole, this study proposed an attack strategy that allowed an outside attacker to steal any participant’s secret input without being detected by a third party and participants. In addition, a simulation experiment was conducted to demonstrate the feasibility of the proposed attack and evaluate the number of quantum Trojan horse probes that the attacker must inject into regular qubit sequences. Finally, a solution was proposed by modifying the protocol to securely prevent quantum Trojan horse attacks.
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.
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.
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.