An Efficient and Secure Arbitrary N-Party Quantum Key Agreement Protocol Using Bell States

Abstract

Two quantum key agreement protocols using Bell states and Bell measurement were recently proposed by Shukla et al.(Quantum Inf. Process. 13(11), 2391-2405, 2014). However, Zhu et al. pointed out that there are some security flaws and proposed an improved version (Quantum Inf. Process. 14(11), 4245-4254, 2015). In this study, we will show Zhu et al.'s improvement still exists some security problems, and its efficiency is not high enough. For solving these problems, we utilize four Pauli operations {I, Z, X, Y } to encode two bits instead of the original two operations {I,X} to encode one bit, and then propose an efficient and secure arbitrary N-party quantum key agreement protocol. In the protocol, the channel checking with decoy single photons is introduced to avoid the eavesdropper's flip attack, and a post-measurement mechanism is used to prevent against the collusion attack. The security analysis shows the present protocol can guarantee the correctness, security, privacy and fairness of quantum key agreement.

arXiv comment13 pages, 5 figures

References in corpus (10)

• Quantum secret sharing
• How to share a quantum secret
• Quantum key distribution in the Holevo limit
• Orthogonal-state-based protocols of quantum key agreement
• Multiparty Quantum Sealed-Bid Auction Using Single Photons as Message Carrier
• Cryptanalysis and improvement of the quantum private comparison protocol based on Bell entangled states
• Secure Quantum Private Comparison of Equality Based on Asymmetric W State
• Same Initial States Attack in Yang et al.'s Quantum Private Comparison Protocol and the Improvement
• Improved Deterministic N-To-One Joint Remote Preparation of an Arbitrary Qubit via EPR Pairs
• Deterministic Joint Remote Preparation of a Four-qubit Cluster-type State via GHZ states

Cited by in corpus (9)

• A Unitary Weights Based One-Iteration Quantum Perceptron Algorithm for Non-Ideal Training Sets
• An optimized quantum minimum searching algorithm with sure-success probability and its experiment simulation with Cirq
• A Novel Quantum Visual Secret Sharing Scheme
• An Improved Quantum Private Set Intersection Protocol Based on Hadamard Gates
• Privacy-Preserving Quantum Two-Party Geometric Intersection
• Quantum Searchable Encryption for Cloud Data Based on Full-Blind Quantum Computation
• A Quantum-based Database Query Scheme for Privacy Preservation in Cloud Environment
• Quantum Privacy-Preserving Price E-Negotiation
• A Unitary Operator Construction Solution Based on Pauli Group for Maximal Dense Coding