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

Security and Communication Networks

Fast convergent key distribution algorithms using a dual quantum channel

Di Jin, Pramode K. Verma, Stamatios V. Kartalopoulos

Published Dec 12, 2008• 10 citations
Publisher

Abstract

Abstract This paper presents three new algorithms over a dual quantum channel to enhance the convergence speed of the key distribution process. The proposed algorithms effectively use a dual quantum channel between the communicating entities and, when combined with the proposed selection of the basis, improve the efficiency of the key distribution process as well as deter Eve. With the use of an initialization vector (IV), the proposed algorithm does not necessitate information exchange about the bases between Alice and Bob, thus removing the requirement of the availability of a two‐way conventional channel. Simultaneously, it allows the detection of the presence of Eve in real time. Copyright © 2008 John Wiley & Sons, Ltd.

DOI
10.1002/sec.91

Related papers

Fast convergent and secure key distribution protocols using a dual-quantum channel

Stamatios V. Kartalopoulos, Pramode K. Verma, Di Jin

This dissertation presents three new quantum key distribution protocols over a dual quantum-channel to enhance the convergence speed of the key distribution process. The proposed protocols effectively use a dual-quantum channel between the communicating entities and, when combined with the proposed selection of the basis, improve the efficiency of the key distribution process as well as deter Eve. With the use of an initialization vector, one of the proposed protocols does not necessitate information exchange about the bases between Alice and Bob, and further eliminates the requirement of the availability of a two-way conventional channel. Simultaneously, it allows the detection of the presence of Eve in real time and proposes several effective defense mechanisms to frustrate Eve's attack.

•Jan 1, 2008•0 citations

Key Distribution Using Dual Quantum Channels

Di Jin, Pramode K. Verma, Stamatios V. Kartalopoulos

Quantum key distribution has been a relatively recent addition to data security and integrity. It is based on advanced ideas that emanate from Quantum theory. Additionally, the optical network and the quantum photon provide a formidable basis for the application of quantum key distribution. We propose a new way of distributing encryption keys over quantum channels. The proposed method takes advantage of dual quantum channels between the communicating entities and complementary measuring bases in order to improve the efficiency with which the keys can be exchanged.

International Conference on Information Assurance and Security (IAS)•Sep 1, 2008•9 citations

Enhancing Quantum Key Distribution (QKD) to address quantum hacking

Luis Adrián Lizama-Pérez, J. Mauricio López, Eduado De Carlos López +1 more

Quantum key distribution (QKD) is intended to produce cryptographic secret keys between two remote parties, usually called Alice and Bob. Even though QKD has been proven to be unconditionally secure against the eavesdropper, commonly called Eve, practical implementations of QKD may contain vulnerabilities that may lead to the generated secret keys being compromised. In order to detect the presence of the eavesdropper in the channel, in our proposal Alice introduces an interleaved sequence of decoy states which produce a characteristic distribution at Bob's station. Thus, in analyzing such distribution in presence and absence of the eavesdropper Eve, her activity in the channel is detected. This protocol doesn’t require changes at the quantum physical level, but it can be incorporated at the high software level.

Procedia Technology•Jan 1, 2012•11 citations

Beyond the Limits of Shannon’s Information in Quantum Key Distribution

Luis Adrián Lizama-Pérez, J. Mauricio López R., Emmanuel H. Samperio

We present a new post-processing method for Quantum Key Distribution (QKD) that raises cubically the secret key rate in the number of double matching detection events. In Shannon's communication model, information is prepared at Alice's side, and it is then intended to pass it over a noisy channel. In our approach, secret bits do not rely in Alice's transmitted quantum bits but in Bob's basis measurement choices. Therefore, measured bits are publicly revealed, while bases selections remain secret. Our method implements sifting, reconciliation, and amplification in a unique process, and it just requires a round iteration; no redundancy bits are sent, and there is no limit in the correctable error percentage. Moreover, this method can be implemented as a post-processing software into QKD technologies already in use.

Entropy•Feb 16, 2021•15 citations

Quantum key distribution with prepare-and-measure Bell test

Yong-Gang Tan

The prepare-and-measure quantum key distribution (QKD) has the merits of fast speed, high key generation rate, and easy implementation. However, the detector side channel attacks greatly undermine the security of the key bits. The eavesdropper, Eve, exploits the flaws of the detectors to obtain illegal information without violating quantum principles. It means that she can intervene in the communication without being detected. A prepare-and-measure Bell test protocol will be proposed. By randomly carrying out Bell test at the side of the information receiver, Bob, Eve's illegal information gain within the detector side channel attack can be well bounded. This protocol does not require any improvement on the detectors used in available prepare-and-measure QKD. Though we only illustrate its application in the BB84 protocol, it is applicable for any prepare-and-measure QKD.

Scientific Reports•Oct 13, 2016•6 citations

A probabilistic quantum key transfer protocol

Abhishek Parakh

ABSTRACT We propose a protocol to transfer a one‐time pad (in a probabilistic manner) from Alice to Bob, over a public channel. The proposed protocol is unique because Bob merely acts as a receiver of the pad (secret key); that is, Bob does not need to send any message back to Alice unless he detects eavesdropping. Such a secure transfer of one‐time pad, over public channel, is not possible in classical cryptography, and in quantum cryptography, all previous protocols require Bob to send almost as many messages back to Alice as she does to Bob to establish a key. Copyright © 2013 John Wiley & Sons, Ltd.

Security and Communication Networks•Mar 13, 2013•17 citations
Abstract This paper presents three new algorithms over a dual quantum channel to enhance the convergence speed of the key distribution process. The proposed algorithms effectively use a dual quantum channel between the communicating entities and, when combined with the proposed selection of the basis, improve the efficiency of the key distribution process as well as deter Eve. With the use of an initialization vector (IV), the proposed algorithm does not necessitate information exchange about the bases between Alice and Bob, thus removing the requirement of the availability of a two‐way conventional channel. Simultaneously, it allows the detection of the presence of Eve in real time. Copyright © 2008 John Wiley & Sons, Ltd.
This dissertation presents three new quantum key distribution protocols over a dual quantum-channel to enhance the convergence speed of the key distribution process. The proposed protocols effectively use a dual-quantum channel between the communicating entities and, when combined with the proposed selection of the basis, improve the efficiency of the key distribution process as well as deter Eve. With the use of an initialization vector, one of the proposed protocols does not necessitate information exchange about the bases between Alice and Bob, and further eliminates the requirement of the availability of a two-way conventional channel. Simultaneously, it allows the detection of the presence of Eve in real time and proposes several effective defense mechanisms to frustrate Eve's attack.
Quantum key distribution has been a relatively recent addition to data security and integrity. It is based on advanced ideas that emanate from Quantum theory. Additionally, the optical network and the quantum photon provide a formidable basis for the application of quantum key distribution. We propose a new way of distributing encryption keys over quantum channels. The proposed method takes advantage of dual quantum channels between the communicating entities and complementary measuring bases in order to improve the efficiency with which the keys can be exchanged.
Quantum key distribution (QKD) is intended to produce cryptographic secret keys between two remote parties, usually called Alice and Bob. Even though QKD has been proven to be unconditionally secure against the eavesdropper, commonly called Eve, practical implementations of QKD may contain vulnerabilities that may lead to the generated secret keys being compromised. In order to detect the presence of the eavesdropper in the channel, in our proposal Alice introduces an interleaved sequence of decoy states which produce a characteristic distribution at Bob's station. Thus, in analyzing such distribution in presence and absence of the eavesdropper Eve, her activity in the channel is detected. This protocol doesn’t require changes at the quantum physical level, but it can be incorporated at the high software level.
We present a new post-processing method for Quantum Key Distribution (QKD) that raises cubically the secret key rate in the number of double matching detection events. In Shannon's communication model, information is prepared at Alice's side, and it is then intended to pass it over a noisy channel. In our approach, secret bits do not rely in Alice's transmitted quantum bits but in Bob's basis measurement choices. Therefore, measured bits are publicly revealed, while bases selections remain secret. Our method implements sifting, reconciliation, and amplification in a unique process, and it just requires a round iteration; no redundancy bits are sent, and there is no limit in the correctable error percentage. Moreover, this method can be implemented as a post-processing software into QKD technologies already in use.
The prepare-and-measure quantum key distribution (QKD) has the merits of fast speed, high key generation rate, and easy implementation. However, the detector side channel attacks greatly undermine the security of the key bits. The eavesdropper, Eve, exploits the flaws of the detectors to obtain illegal information without violating quantum principles. It means that she can intervene in the communication without being detected. A prepare-and-measure Bell test protocol will be proposed. By randomly carrying out Bell test at the side of the information receiver, Bob, Eve's illegal information gain within the detector side channel attack can be well bounded. This protocol does not require any improvement on the detectors used in available prepare-and-measure QKD. Though we only illustrate its application in the BB84 protocol, it is applicable for any prepare-and-measure QKD.
ABSTRACT We propose a protocol to transfer a one‐time pad (in a probabilistic manner) from Alice to Bob, over a public channel. The proposed protocol is unique because Bob merely acts as a receiver of the pad (secret key); that is, Bob does not need to send any message back to Alice unless he detects eavesdropping. Such a secure transfer of one‐time pad, over public channel, is not possible in classical cryptography, and in quantum cryptography, all previous protocols require Bob to send almost as many messages back to Alice as she does to Bob to establish a key. Copyright © 2013 John Wiley & Sons, Ltd.