Multi-Party Quantum Summation Based on Quantum Teleportation

Cai, Zhang; Razavi, Mohsen; Sun, Zhiwei; Huang, Qiong; Situ, Haozhen

doi:10.3390/e21070719

Cited by 12 publications

(6 citation statements)

References 45 publications

(67 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Using quantum systems, the references [9], [10], [11], [12] proposed a protocol to securely calculate modulo summation, which is essentially equivalent to the generation of secure modulo zero-sum randomness. However, they did not propose a method to verify the secrecy and the correctness of their computation.…”

Section: A Other Quantum Methods For Secure Modulo Summationmentioning

confidence: 99%

“…[Note that the significance level is the maximum passing probability when malicious Bob sends incorrect states so that the resultant state α does not satisfy Eqs. ( 11) and (12).] Proof of Theorem 3: Assume that S 1 is composed of j 1 , .…”

Section: Quantum Protocol For Secure Modulo Zero-sum Randomnessmentioning

confidence: 99%

“…In this way, the verification of conventional methods are not so simple. Although several quantum protocols for secure modulo summation are proposed [9], [10], [11], [12], their verification has not been discussed.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Verifiable Quantum Secure Modulo Summation

Hayashi,

Koshiba

2019

Preprint

View full text Add to dashboard Cite

We propose a new cryptographic task, which we call verifiable quantum secure modulo summation. Secure modulo summation is a calculation of modulo summation Y 1 + . . . + Y m when m players have their individual variables Y 1 , . . . , Y m with keeping the secrecy of the individual variables. However, the conventional method for secure modulo summation uses so many secret communication channels. We say that a quantum protocol for secure modulo summation is quantum verifiable secure modulo summation when it can verify the desired secrecy condition. If we combine device independent quantum key distribution, it is possible to verify such secret communication channels. However, it consumes so many steps. To resolve this problem, using quantum systems, we propose a more direct method to realize secure modulo summation with verification. To realize this protocol, we propose modulo zero-sum randomness as another new concept, and show that secure modulo summation can be realized by using modulo zero-sum randomness. Then, we construct a verifiable quantum protocol method to generate modulo zero-sum randomness. This protocol can be verified only with minimum requirements.

show abstract

Section: A Other Quantum Methods For Secure Modulo Summationmentioning

confidence: 99%

Section: Quantum Protocol For Secure Modulo Zero-sum Randomnessmentioning

confidence: 99%

See 1 more Smart Citation

Verifiable Quantum Secure Modulo Summation

Hayashi,

Koshiba

2019

Preprint

View full text Add to dashboard Cite

show abstract

“…Then Liu et al [11] presented a quantum summation protocol using Pauli matrices operations to encode information for extracting information, and a quantum summation protocol based on the commutative encryption [12] was proposed. In 2017, Zhang et al [13] put forward a multi-party quantum summation protocol based on single particles without a trusted third party.…”

Section: Introductionmentioning

confidence: 99%

Secure Multi-Party Quantum Summation Based on Quantum Homomorphic Encryption

Xu¹,

Fan²,

Chen³

et al. 2022

Intelligent Automation &Amp; Soft Computing

View full text Add to dashboard Cite

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.

show abstract

“…Ji et al [20] have discussed how to implement these applications by using quantum summation protocols. A considerable number of quantum summation protocols have thus been proposed by using various quantum states, including single photons in two degrees of freedom [21], Bell states [22,23], Greenberger-Horne-Zeilinger (GHZ) states [24], genuinely maximally entangled six-qubit states [25], and multi-partite high-dimensional entangled states [16,20,26,27,28].…”

Section: Introductionmentioning

confidence: 99%

Improvements on “Secure multi-party quantum summation based on quantum Fourier transform”

Cai

Razavi

Sun

et al. 2019

Quantum Inf Process

Self Cite

View full text Add to dashboard Cite

Recently, a quantum multi-party summation protocol based on the 1 quantum Fourier transform has been proposed [Quantum Inf Process 17: 129, 2 2018]. The protocol claims to be secure against both outside and participant 3 attacks. However, a closer look reveals that the player in charge of generating 4 the required multi-partite entangled states can launch two kinds of attacks to 5learn about other parties' private integer strings without being caught. In this 6 paper, we present these attacks, and propose countermeasures to make the 7 protocol secure again. The improved protocol not only can resist these attacks 8 but also remove the need for the quantum Fourier transform and encoding 9 quantum operations by participants. 10

show abstract

Multi-Party Quantum Summation Based on Quantum Teleportation

Cited by 12 publications

References 45 publications

Verifiable Quantum Secure Modulo Summation

Verifiable Quantum Secure Modulo Summation

Secure Multi-Party Quantum Summation Based on Quantum Homomorphic Encryption

Improvements on “Secure multi-party quantum summation based on quantum Fourier transform”

Contact Info

Product

Resources

About