Secure multi-party quantum summation based on quantum Fourier transform
arXiv:2205.06123 · doi:10.1007/s11128-018-1890-1
Abstract
In this paper, we propose a novel secure multi-party quantum summation protocol based on quantum Fourier transform, where the traveling particles are transmitted in a tree-type mode. The party who prepares the initial quantum states is assumed to be semi-honest, which means that she may misbehave on her own but will not conspire with anyone. The proposed protocol can resist both the outside attacks and the participant attacks. Especially, one party cannot obtain other parties' private integer strings; and it is secure for the colluding attack performed by at most n-2 parties, where n is the number of parties. In addition, the proposed protocol calculates the addition of modulo d and implements the calculation of addition in a secret-by-secret way rather than a bit-by-bit way.
arXiv comment10 pages, 2 figures, 2 tables
References in corpus (22)
- Quantum secret sharing
- Simple Proof of Security of the BB84 Quantum Key Distribution Protocol
- A Two-Step Quantum Direct Communication Protocol Using Einstein-Podolsky-Rosen Pair Block
- Theoretical efficient high capacity Quantum Key Distribution Scheme
- Secure Direct Communication with a Quantum One-Time-Pad
- Efficient Multi-Party Quantum Secret Sharing Schemes
- Quantum key distribution in the Holevo limit
- Insecurity of Quantum Secure Computations
- Cryptanalysis of the Hillery-Buzek-Berthiaume quantum secret-sharing protocol
- Secure quantum key distribution network with Bell states and local unitary operations
- Practical private database queries based on a quantum key distribution protocol
- Efficient quantum cryptography network without entanglement and quantum memory
- Towards quantum-based privacy and voting
- Improving the security of quantum exam against cheating
- Orthogonal-state-based protocols of quantum key agreement
- Post-processing of the oblivious key in quantum private queries
- QKD-based quantum private query without a failure probability
- Secure Multiparty Quantum Computation with (Only) a Strict Honest Majority
- Cryptanalysis of a multi-party quantum key agreement protocol with single particles
- Quantum-Classical Complexity-Security Tradeoff In Secure Multi-Party Computation
- Multi-party Quantum Computation
- Multiparty quantum key agreement protocol secure against collusion attacks
Cited by in corpus (8)
- Two-party secure semiquantum summation against the collective-dephasing noise
- Three-party secure semiquantum summation without entanglement among quantum user and classical users
- A lightweight three-user secure quantum summation protocol without a third party based on single-particle states
- Secure and Efficient Two-party Quantum Scalar Product Protocol With Application to Privacy-preserving Matrix Multiplication
- Multi-party quantum summation based on quantum teleportation
- Verifiable Quantum Secure Modulo Summation
- Improvement on "Secure multi-party quantum summation based on quantum Fourier transform"
- Improvements on "Secure multi-party quantum summation based on quantum Fourier transform"