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

arXiv:quant-ph/0510208 · International Conference on Computational Intelligence and Security (CIS)

Quantum key distribution protocols using entangled state

Jian Wang, Quan Zhang, Chaojing Tang

Published Nov 1, 2006• 8 citations
arXivHTMLPDF

Abstract

We present three quantum key distribution protocols using entangled state. The first protocol is based on the idea of qubit transmission in blocks. Although it needs quantum memory, its theoretic efficiency approximates to 100%. The second protocol does not need quantum memory and its efficiency for qubits can achieve 100%. The third protocol is a controlled quantum key distribution protocol which can be applied to a special cryptographic scenario

DOI
10.1109/iccias.2006.295280

Related papers

A Controlled Quantum Key Distribution Scheme with Three-Particle Entanglement

Chao Han, Xue Peng, Guo Guang-Can

We present a controlled quantum key distribution protocol with a certain entangled state to solve a special cryptographic task. Also, we provide a proof of security of this protocol by generalizing the proof of the modified Lo-Chau Einstein-Podolsky-Rosen scheme.

Chinese Physics Letters•Jan 23, 2003•9 citations

A controlled Quantum Key Distribution Scheme with Three—Particle Entanglement

韩超, P. Xue

We present a controlled quantum key distribution protocol with a certain entangled state to solve a special cryptographic task.Also,we provide a proof of security of this protocol by generalizing the proof of the modified Lo-Chau Einstein-Podolsky-Rosen scheme.

Chinese Physics Letters•Jan 1, 2003•0 citations

Efficient multiuser quantum cryptography network based on entanglement

Peng Xue, Kunkun Wang, Xiaoping Wang

We present an efficient quantum key distribution protocol with a certain entangled state to solve a special cryptographic task. Also, we provide a proof of security of this protocol by generalizing the proof of modified of Lo-Chau scheme. Based on this two-user scheme, a quantum cryptography network protocol is proposed without any quantum memory.

Scientific Reports•Apr 4, 2017•15 citations

Quantum key distribution based on orthogonal states.

Hao Shu

Quantum key distribution(QKD) is one of the most significant areas in quantum information theory. For nearly four decades, substantial QKD protocols and cryptographic methods are developed. In early years, the security of protocols are depend on switching different bases, which, in fact, are based on non-orthogonal states. The most famous example is the BB84 protocol. Later, other techniques were developed for orthogonal states cryptography. Representations of such protocols including the GV protocol and order-rearrangement protocols. It might be harder to implement protocols based on orthogonal states since they require extra techniques to obtain security. In this paper, we give two QKD protocols based on orthogonal states. One of them needs not to employ order-rearrangement techniques while the other needs. We give analyses of their security and efficiency. Also, anti-noisy discussions would be given. Our protocols are highly efficient when considering consumptions of both qubits and classical bits while they are robust over several noisy channels. Moveover, the requirements of maximally entangled states maybe less than previous protocols and so the efficiency of measurements may be increased.

•Jul 5, 2021•2 citations

Efficiency in Quantum Key Distribution Protocols with Entangled Gaussian States

Carles Rodó, Oriol Romero‐Isart, K. Eckert +1 more

Quantum key distribution (QKD) refers to specific quantum strategies which permit the secure distribution of a secret key between two parties that wish to communicate secretly. Quantum cryptography has proven unconditionally secure in ideal scenarios and has been successfully implemented using quantum states with finite (discrete) as well as infinite (continuous) degrees of freedom. Here, we analyze the efficiency of QKD protocols that use as a resource entangled gaussian states and gaussian operations only. In this framework, it has already been shown that QKD is possible [1] but the issue of its efficiency has not been considered. We propose a figure of merit (the efficiency E) to quantify the number of classical correlated bits that can be used to distill a key from a sample of N entangled states. We relate the efficiency of the protocol to the entanglement and purity of the states shared between the parties.

arXiv:quant-ph/0611277•Open Systems & Information Dynamics•Mar 1, 2007•13 citations

Improving the efficiency of entanglement based quantum key exchange

Abhishek Parakh, Pramode K. Verma

This article presents two efficient cryptographic protocols, based on quantum entanglement, for secure exchange of secret keys. While the first protocol requires storage of entangled qubits, the second protocol has no storage requirements and presents a probabilistic model. We show that there is a tradeoff between security against eavesdropping and the efficiency of the protocol in terms of usable bits available for the secret key. This security parameter s can be varied by the communicating parties based on practical considerations.

International Conference on Computer Communications and Networks (ICCCN)•Aug 1, 2014•3 citations
We present three quantum key distribution protocols using entangled state. The first protocol is based on the idea of qubit transmission in blocks. Although it needs quantum memory, its theoretic efficiency approximates to 100%. The second protocol does not need quantum memory and its efficiency for qubits can achieve 100%. The third protocol is a controlled quantum key distribution protocol which can be applied to a special cryptographic scenario
Quantum key distribution(QKD) is one of the most significant areas in quantum information theory. For nearly four decades, substantial QKD protocols and cryptographic methods are developed. In early years, the security of protocols are depend on switching different bases, which, in fact, are based on non-orthogonal states. The most famous example is the BB84 protocol. Later, other techniques were developed for orthogonal states cryptography. Representations of such protocols including the GV protocol and order-rearrangement protocols. It might be harder to implement protocols based on orthogonal states since they require extra techniques to obtain security. In this paper, we give two QKD protocols based on orthogonal states. One of them needs not to employ order-rearrangement techniques while the other needs. We give analyses of their security and efficiency. Also, anti-noisy discussions would be given. Our protocols are highly efficient when considering consumptions of both qubits and classical bits while they are robust over several noisy channels. Moveover, the requirements of maximally entangled states maybe less than previous protocols and so the efficiency of measurements may be increased.
Quantum key distribution (QKD) refers to specific quantum strategies which permit the secure distribution of a secret key between two parties that wish to communicate secretly. Quantum cryptography has proven unconditionally secure in ideal scenarios and has been successfully implemented using quantum states with finite (discrete) as well as infinite (continuous) degrees of freedom. Here, we analyze the efficiency of QKD protocols that use as a resource entangled gaussian states and gaussian operations only. In this framework, it has already been shown that QKD is possible [1] but the issue of its efficiency has not been considered. We propose a figure of merit (the efficiency E) to quantify the number of classical correlated bits that can be used to distill a key from a sample of N entangled states. We relate the efficiency of the protocol to the entanglement and purity of the states shared between the parties.
This article presents two efficient cryptographic protocols, based on quantum entanglement, for secure exchange of secret keys. While the first protocol requires storage of entangled qubits, the second protocol has no storage requirements and presents a probabilistic model. We show that there is a tradeoff between security against eavesdropping and the efficiency of the protocol in terms of usable bits available for the secret key. This security parameter s can be varied by the communicating parties based on practical considerations.