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

Mathematics

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

Chun‐Wei Yang, Chia‐Wei Tsai, Chi‐An Chen, Jason Lin

Published Mar 14, 2023• 13 citations
Publisher

Abstract

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.

DOI
10.3390/math11061405

Related papers

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

Chia‐Wei Tsai, Chun‐Hsiang Wang, Chun‐Wei Yang +1 more

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.

EPJ Quantum Technology•Sep 29, 2025•1 citation

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

A novel quantum multiparty summation protocol based on a cooperative random number mechanism

Kejia Zhang, Yu Zhang, Xue Zhang +3 more

As a particular area of quantum security multiparty computation, quantum secure multiparty summation plays a critical role in modern cryptography. It is widely known that most of the existing quantum summation protocols are based on an honest or semi-honest third party (TP). However, the introduced TP makes the protocol difficult to implement in practice, as it may face a single-point-of-failure attack on TP. Although some TP-free protocols are proposed to mitigate this risk, the increased cost of communication reduces its efficiency. To address these issues, a novel quantum-secure multiparty summation protocol based on a cooperative random number distribution mechanism (QMS-CRM) is proposed in this paper for the first time. During it, this mechanism is designed using Shamir’s secret sharing scheme. Furthermore, this approach eliminates the requirement for random number exchange between participants without the help of TP, enhancing the efficiency of the protocol. The security analysis demonstrates that the proposed protocol can resist both external attacks and collusion attacks by up to $n - 2$ participants. Finally, we simulated the protocol on the IBM Quantum Cloud platform, confirming its feasibility.

EPJ Quantum Technology•May 22, 2025•1 citation

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

Two-party semi-quantum key agreement protocol for seven-particle entangled states in collective noise channels

She-Xiang Jiang, Jinhuan Li, Shuaishuai Li +1 more

Abstract The semi-quantum key agreement (SQKA) is a combination of the ‘semi-quantum’ concept in the quantum key agreement (QKA), which aims to reduce the requirements on the quantum ability of the participants while maintaining the security of the key agreement. In this paper, two novel two-party SQKA protocols based on seven-particle entangled states and delegated quantum centers in the collective noise channels are proposed. In the two SQKA protocols, only the quantum center possesses full quantum capabilities, while other participants have only partial quantum abilities. The classical party, on the other hand, only needs to perform Z-basis measurement on the classical basis. Due to the properties of entangled states, the two SQKA protocols can resist internal and external attacks. Furthermore, this paper provides a comprehensive analysis of the security of the proposed protocols, illustrating their resilience against various forms of attacks such as eavesdropping, intercept-resend attacks, and entangle-measure attacks. The results indicate that both protocols perform well in collective noise channels while maintaining high security even under noisy conditions. Moreover, eavesdropping simulation can detect whether there is eavesdropping behavior in the communication process. Finally, a comparison with existing protocols shows that the two proposed protocols exhibit higher qubit efficiency.

Physica Scripta•Mar 6, 2025•5 citations

Collective noise-resistant multi-party semi-quantum secret sharing protocols

Jian Li, Chong‐Qiang Ye, Wang Zhuo

Abstract Semi-quantum secret sharing facilitates the sharing of private data between quantum users and ‘classical’ users with limited quantum capabilities, thereby lowering the barrier to utilizing quantum technology. However, most current semi-quantum secret sharing protocols are confined to ideal environments and two-party scenarios. In this paper, we design two collective noise-resistant multi-party semi-quantum secret sharing protocols based on decoherence-free states to address potential noise interference during transmission. These protocols use decoherence-free states as information carriers for data interaction and exhibit strong resilience to both internal and external threats. We also conduct simulation experiments using IBM Qiskit to verify the stability and feasibility of the protocols in the noisy environments. The results of these experiments underscore the robustness of the protocols, particularly in the presence of collective noise. Compared with previous related protocols, our protocols have advantages in noise resistance and applicability to multi-party scenarios. Therefore, the proposed protocols may be more in line with the secret sharing needs of actual environments.

Physica Scripta•Aug 12, 2024•4 citations
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.
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.
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.
As a particular area of quantum security multiparty computation, quantum secure multiparty summation plays a critical role in modern cryptography. It is widely known that most of the existing quantum summation protocols are based on an honest or semi-honest third party (TP). However, the introduced TP makes the protocol difficult to implement in practice, as it may face a single-point-of-failure attack on TP. Although some TP-free protocols are proposed to mitigate this risk, the increased cost of communication reduces its efficiency. To address these issues, a novel quantum-secure multiparty summation protocol based on a cooperative random number distribution mechanism (QMS-CRM) is proposed in this paper for the first time. During it, this mechanism is designed using Shamir’s secret sharing scheme. Furthermore, this approach eliminates the requirement for random number exchange between participants without the help of TP, enhancing the efficiency of the protocol. The security analysis demonstrates that the proposed protocol can resist both external attacks and collusion attacks by up to n−2n - 2n−2 participants. Finally, we simulated the protocol on the IBM Quantum Cloud platform, confirming its feasibility.
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 The semi-quantum key agreement (SQKA) is a combination of the ‘semi-quantum’ concept in the quantum key agreement (QKA), which aims to reduce the requirements on the quantum ability of the participants while maintaining the security of the key agreement. In this paper, two novel two-party SQKA protocols based on seven-particle entangled states and delegated quantum centers in the collective noise channels are proposed. In the two SQKA protocols, only the quantum center possesses full quantum capabilities, while other participants have only partial quantum abilities. The classical party, on the other hand, only needs to perform Z-basis measurement on the classical basis. Due to the properties of entangled states, the two SQKA protocols can resist internal and external attacks. Furthermore, this paper provides a comprehensive analysis of the security of the proposed protocols, illustrating their resilience against various forms of attacks such as eavesdropping, intercept-resend attacks, and entangle-measure attacks. The results indicate that both protocols perform well in collective noise channels while maintaining high security even under noisy conditions. Moreover, eavesdropping simulation can detect whether there is eavesdropping behavior in the communication process. Finally, a comparison with existing protocols shows that the two proposed protocols exhibit higher qubit efficiency.
Abstract Semi-quantum secret sharing facilitates the sharing of private data between quantum users and ‘classical’ users with limited quantum capabilities, thereby lowering the barrier to utilizing quantum technology. However, most current semi-quantum secret sharing protocols are confined to ideal environments and two-party scenarios. In this paper, we design two collective noise-resistant multi-party semi-quantum secret sharing protocols based on decoherence-free states to address potential noise interference during transmission. These protocols use decoherence-free states as information carriers for data interaction and exhibit strong resilience to both internal and external threats. We also conduct simulation experiments using IBM Qiskit to verify the stability and feasibility of the protocols in the noisy environments. The results of these experiments underscore the robustness of the protocols, particularly in the presence of collective noise. Compared with previous related protocols, our protocols have advantages in noise resistance and applicability to multi-party scenarios. Therefore, the proposed protocols may be more in line with the secret sharing needs of actual environments.