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

EPJ Quantum Technology

Security analysis and improvements of semi-quantum summation models without measurement

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

Published Sep 29, 2025• 1 citation
Publisher

Abstract

Tian et al. (EPJ Quantum Technol 11(1):35, 2024 ) proposed three semi-quantum summation protocols that enable resource-limited participants to securely compute the sum of their private inputs with assistance from a semi-honest third party (TP). In these protocols, participants do not need quantum measurement devices to achieve secure computation. Although the protocols have been analyzed against common attacks to demonstrate their robustness, this study identifies two significant issues in Tian et al.’s work: a security loophole and a design flaw. The security loophole permits a malicious participant to steal another participant’s private input without detection, while the design flaw prevents participants from obtaining the correct summation result when the number of participants is odd. To address these issues, this study proposes improved semi-quantum summation protocols under the same assumptions and environment.

DOI
10.1140/epjqt/s40507-025-00416-4

Related papers

Improvements on "Multi-Party Quantum Summation without a Third Party based on $d$-Dimensional Bell States"

Xiaobing Li, Jiale Hou, Haozhen Situ +1 more

In 2021, Wu et al. presented a multi-party quantum summation scheme exploiting the entanglement properties of d-dimensional Bell states (Wu et al. in Quantum Inf Process 20:200, 2021). In particular, the authors proposed a three-party quantum summation protocol and then extended their work to a multi-party case. It is claimed that their protocol is secure against outside and participants' attacks. However, this work points out that Wu's protocol has a loophole, i.e., two or more dishonest participants who meet a specific location relationship can conspire to obtain the private inputs of some honest participants without being detected. Accordingly, improvements are proposed to address these issues.

arXiv:2307.10908•Jul 20, 2023•0 citations

Robust Semi-Quantum Summation over a Collective-Dephasing Noise Channel

Chun‐Wei Yang, Chia‐Wei Tsai, Chi‐An Chen +1 more

Quantum summation is one of the various applications in secure multi-party computation. However, most of the existing quantum summation protocols assume that the participants possess all the quantum devices. Considering future applications, the capability of the participants must be adjusted before it can be put into practical use. Although Boyer et al. proposed that the semi-quantum environment could be used to solve this problem; another practical problem is the interference by noise. In 2022, Ye et al. proposed a two-party semi-quantum summation (SQS) protocol resistant to the interference of collective noise, in which two classical participants can accomplish the summation of their private binary sequences with the assistance of a quantum semi-honest third party. They proved that their SQS protocol is resistant to various eavesdropping attacks. This paper unveils two risks of information leakage in Ye et al.’s SQS protocol. If the aforementioned security issues are not resolved, Ye et al.’s SQS protocol may not be able to perform private quantum computations securely. Fortunately, the SQS protocol against the collective-dephasing noise proposed in this study is free from the issue of information leakage as well as resistant to various quantum attacks. In addition, the quantum efficiency of the SQS protocol proposed in this study is four times higher than that of Ye et al.’s SQS protocol, which can effectively improve the quantum utilization rate.

Mathematics•Mar 14, 2023•13 citations

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•15 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

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

Cryptanalysis and Improvement of Quantum Private Comparison Protocol Based on Bell Entangled States

Wenjie Liu, Chao Liu, Hanwu Chen +2 more

Recently, Liu et al. [ Commun. Theor. Phys. 57 (2012) 583 ] proposed a quantum private comparison protocol based on entanglement swapping of Bell states, which aims to securely compare the equality of two participants' information with the help of a semi-honest third party (TP). However, the present study points out there is a fatal loophole in Liu et al.'s protocol, and TP can make Bell-basis measurement to know all the participants' secret inputs without being detected. To fix the problem, a simple solution, which uses one-time eavesdropper checking with decoy photons instead of twice eavesdropper checking with Bell states, is demonstrated. Compared with the original protocol, it not only reduces the Bell states consumption but also simplifies the protocol steps.

arXiv:1405.6455•Communications in Theoretical Physics•Aug 1, 2014•28 citations
Tian et al. (EPJ Quantum Technol 11(1):35, 2024 ) proposed three semi-quantum summation protocols that enable resource-limited participants to securely compute the sum of their private inputs with assistance from a semi-honest third party (TP). In these protocols, participants do not need quantum measurement devices to achieve secure computation. Although the protocols have been analyzed against common attacks to demonstrate their robustness, this study identifies two significant issues in Tian et al.’s work: a security loophole and a design flaw. The security loophole permits a malicious participant to steal another participant’s private input without detection, while the design flaw prevents participants from obtaining the correct summation result when the number of participants is odd. To address these issues, this study proposes improved semi-quantum summation protocols under the same assumptions and environment.
Improvements on "Multi-Party Quantum Summation without a Third Party based on ddd-Dimensional Bell States"
In 2021, Wu et al. presented a multi-party quantum summation scheme exploiting the entanglement properties of d-dimensional Bell states (Wu et al. in Quantum Inf Process 20:200, 2021). In particular, the authors proposed a three-party quantum summation protocol and then extended their work to a multi-party case. It is claimed that their protocol is secure against outside and participants' attacks. However, this work points out that Wu's protocol has a loophole, i.e., two or more dishonest participants who meet a specific location relationship can conspire to obtain the private inputs of some honest participants without being detected. Accordingly, improvements are proposed to address these issues.
Quantum summation is one of the various applications in secure multi-party computation. However, most of the existing quantum summation protocols assume that the participants possess all the quantum devices. Considering future applications, the capability of the participants must be adjusted before it can be put into practical use. Although Boyer et al. proposed that the semi-quantum environment could be used to solve this problem; another practical problem is the interference by noise. In 2022, Ye et al. proposed a two-party semi-quantum summation (SQS) protocol resistant to the interference of collective noise, in which two classical participants can accomplish the summation of their private binary sequences with the assistance of a quantum semi-honest third party. They proved that their SQS protocol is resistant to various eavesdropping attacks. This paper unveils two risks of information leakage in Ye et al.’s SQS protocol. If the aforementioned security issues are not resolved, Ye et al.’s SQS protocol may not be able to perform private quantum computations securely. Fortunately, the SQS protocol against the collective-dephasing noise proposed in this study is free from the issue of information leakage as well as resistant to various quantum attacks. In addition, the quantum efficiency of the SQS protocol proposed in this study is four times higher than that of Ye et al.’s SQS protocol, which can effectively improve the quantum utilization rate.
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.
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.
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.
Recently, Liu et al. [ Commun. Theor. Phys. 57 (2012) 583 ] proposed a quantum private comparison protocol based on entanglement swapping of Bell states, which aims to securely compare the equality of two participants' information with the help of a semi-honest third party (TP). However, the present study points out there is a fatal loophole in Liu et al.'s protocol, and TP can make Bell-basis measurement to know all the participants' secret inputs without being detected. To fix the problem, a simple solution, which uses one-time eavesdropper checking with decoy photons instead of twice eavesdropper checking with Bell states, is demonstrated. Compared with the original protocol, it not only reduces the Bell states consumption but also simplifies the protocol steps.