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.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.

Jul 23, 201912 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.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 InformationJun 8, 20240 citations

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.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 InformationMar 1, 201558 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.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 ComputingJan 1, 202217 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.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 TechnologyMay 22, 20251 citation

Multi-party quantum summation with a single d-level quantum system

Cai Zhang, Haozhen Situ, Qiong Huang +2 more

A multi-party quantum summation with a single [Formula: see text]-level quantum system is proposed, in which a semi-honest third party (TP) is employed. Only sequential communication of a single quantum [Formula: see text]-level system (for any prime [Formula: see text]) is required in the presented protocol, resulting in advantages in scalability. In addition, it can be realized with state-of-the-art technology. Due to the semi-honest TP, the protocol is not only secure against outside attacks, but also secure against participant attacks.A multi-party quantum summation with a single [Formula: see text]-level quantum system is proposed, in which a semi-honest third party (TP) is employed. Only sequential communication of a single quantum [Formula: see text]-level system (for any prime [Formula: see text]) is required in the presented protocol, resulting in advantages in scalability. In addition, it can be realized with state-of-the-art technology. Due to the semi-honest TP, the protocol is not only secure against outside attacks, but also secure against participant attacks.

International Journal of Quantum InformationApr 1, 20194 citations

n - 2

participants. Finally, we simulated the protocol on the IBM Quantum Cloud platform, confirming its feasibility.