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

IEEE Long Island Systems, Applications and Technology Conference (LISAT)

Initiated decoy states in quantum key distribution protocol by 3 ways channel

Abdulbast A. Abushgra, Khaled M. Elleithy

Published May 1, 2015• 13 citations
Publisher

Abstract

After decades of research, computer scientists have in recent years come close to reaching substantive results which prove the usability of quantum key distribution (QKD). Several QKD protocols and different schemes have surfaced since the last century. Additionally, some of these protocols were created in new algorithms and up until now, have been proven to be secure; however, other scientists only made modifications to previous original protocols. This paper seeks to create a new scheme in QKD that will communicate between two parties and will give them a high level of security against any well-known attacks while handling both of parties in a manner that will reduce their dependency on both classic communication and the classical channel.

DOI
10.1109/lisat.2015.7160178

Related papers

Development of Quantum Key Distribution and Attacks against It

Yusheng Zhao

Secure and efficient communication between two parties always incents scholars for further research. Creation of such a means of communication yields commercial benefits for our society. With the creation of a quantum computer, some classical protocols used for secure communication is no longer secure. Quantum key distribution is created to solve this problem. Although a quantum key distribution protocol is in theory guaranteed to be secure, there has been ways to breach its security in real life application. Since the creation of the first quantum key distribution protocol, there has been a rival between the defending and attacking side of quantum key distribution. In this paper, we first seek to discuss the basics of the first quantum key distribution protocol. Secondly, we discuss about the attacks against that protocol and the modifications made to the protocol in response to these attacks. Currently, researchers have permanently closed one side of the implementation loophole that could give rise to potential means of hacking of the protocol.

Journal of Physics Conference Series•Sep 1, 2018•0 citations

An Efficient Algorithm on Quantum Computing With Quantum Key Distribution for Secure Communication

Ganapathy Senthil Murugan

Currently many symmetric key cryptographic tools which are known to be quantum-safe. They all share Secret symmetric keys through an untrusted medium which is usually done with public key methods which are prone to quantum attacks. One among the recommended solutions to the key distribution problem is Quantum Key Distribution (QKD). QKD utilizes an authenticated Communication channel along with a quantum communication channel so that a secret key is generated. Whatever may be the protocol to implement proposed QKD, they all need both a quantum channel, and an authenticated classical. OTP (One Time Pad) is used when two parties wish to communications have to share a key called pad. This pad is a randomly generated key and the length of the key should be equal to the message so it can be sent. The proposed QKD parameters that result in almost 35.67% smaller keys for quantum security and an implementation of QKD in network which is publicly available and usable in practice.

International journal of communication•May 14, 2020•2 citations

Decoy-state quantum key distribution with two-way classical postprocessing

Xiongfeng Ma, Chi‐Hang Fred Fung, Frédéric Dupuis +3 more

Decoy states have recently been proposed as a useful method for substantially improving the performance of quantum key distribution (QKD) protocols when a coherent-state source is used. Previously, data postprocessing schemes based on one-way classical communications were considered for use with decoy states. In this paper, we develop two data postprocessing schemes for the decoy-state method using two-way classical communications. Our numerical simulation (using parameters from a specific QKD experiment as an example) results show that our scheme is able to extend the maximal secure distance from $142\phantom{\rule{0.3em}{0ex}}\mathrm{km}$ (using only one-way classical communications with decoy states) to $181\phantom{\rule{0.3em}{0ex}}\mathrm{km}$. The second scheme is able to achieve a 10% greater key generation rate in the whole regime of distances. We conclude that decoy-state QKD with two-way classical postprocessing is of practical interest.

arXiv:quant-ph/0604094•Physical Review A•Sep 25, 2006•76 citations

Secure Communication with One Decoy State and Two Way Quantum Key Distribution Scheme

Mohd Fared Abdul Khir, Iskandar Bahari, M. N. Mohd Zain +1 more

Quantum Key Distribution (QKD) provides a mean for unconditionally secure secret key sharing for secure communication. For a practical QKD system, the recently proposed decoy state protocol has become an essential tool. In this work, we conduct numerical analysis against several bounds for one decoy state with two way QKD protocol and compare their performance in terms of key rate and maximum secure distance.

•Jan 1, 2013•1 citation

A QKD protocol with a two-way quantum channel

Farnaz Zamani, Pramode K. Verma

Quantum key distribution (QKD) provides unconditional physical layer security for the distribution of encryption keys between legitimate parties. This paper presents a quantum key distribution protocol over a two-way quantum channel. This protocol does not require any classical communication channel for key sifting and key reconciliation. Utilizing the proposed protocol, one can reduce the overhead in the classical channel and increase the speed with which keys can be exchanged. Absence of a classical communication channel reduces operational overhead.

IEEE International Conference on Advanced Networks and Telecommunications Systems•Dec 1, 2011•20 citations

Secure Communication Using Two Party Authenticated Quantum key Distribution Protocols

S. Venkatramulu, S. Veena

This work presents quantum key distribution protocols (QKDPs) to safeguard security in large networks, efficiency is improved as the proposed protocols contain the fewest number of communication rounds and two parties can share and use a long-term secret Key. Quantum cryptography is basically based on a trusted channel in communication between two parties compared to classical channel. Recently, Quantum Key Distribution (QKD) has become more secure transmission method used to transmit secret key between two legitimate parties. This paper discusses the implementation of (QKD) protocol with the existence of an eavesdropper. The implementation simulates the communication of two parties who wish to share a secret key with the existing of eavesdropper. The existing of eavesdropper is simulated with two kinds of attacks, which is used as parameter to measure the length of final key agreed by both authenticated parties at the end of the communication.

•Jan 1, 2010•5 citations
After decades of research, computer scientists have in recent years come close to reaching substantive results which prove the usability of quantum key distribution (QKD). Several QKD protocols and different schemes have surfaced since the last century. Additionally, some of these protocols were created in new algorithms and up until now, have been proven to be secure; however, other scientists only made modifications to previous original protocols. This paper seeks to create a new scheme in QKD that will communicate between two parties and will give them a high level of security against any well-known attacks while handling both of parties in a manner that will reduce their dependency on both classic communication and the classical channel.
Secure and efficient communication between two parties always incents scholars for further research. Creation of such a means of communication yields commercial benefits for our society. With the creation of a quantum computer, some classical protocols used for secure communication is no longer secure. Quantum key distribution is created to solve this problem. Although a quantum key distribution protocol is in theory guaranteed to be secure, there has been ways to breach its security in real life application. Since the creation of the first quantum key distribution protocol, there has been a rival between the defending and attacking side of quantum key distribution. In this paper, we first seek to discuss the basics of the first quantum key distribution protocol. Secondly, we discuss about the attacks against that protocol and the modifications made to the protocol in response to these attacks. Currently, researchers have permanently closed one side of the implementation loophole that could give rise to potential means of hacking of the protocol.
Currently many symmetric key cryptographic tools which are known to be quantum-safe. They all share Secret symmetric keys through an untrusted medium which is usually done with public key methods which are prone to quantum attacks. One among the recommended solutions to the key distribution problem is Quantum Key Distribution (QKD). QKD utilizes an authenticated Communication channel along with a quantum communication channel so that a secret key is generated. Whatever may be the protocol to implement proposed QKD, they all need both a quantum channel, and an authenticated classical. OTP (One Time Pad) is used when two parties wish to communications have to share a key called pad. This pad is a randomly generated key and the length of the key should be equal to the message so it can be sent. The proposed QKD parameters that result in almost 35.67% smaller keys for quantum security and an implementation of QKD in network which is publicly available and usable in practice.
Decoy states have recently been proposed as a useful method for substantially improving the performance of quantum key distribution (QKD) protocols when a coherent-state source is used. Previously, data postprocessing schemes based on one-way classical communications were considered for use with decoy states. In this paper, we develop two data postprocessing schemes for the decoy-state method using two-way classical communications. Our numerical simulation (using parameters from a specific QKD experiment as an example) results show that our scheme is able to extend the maximal secure distance from 142km142\phantom{\rule{0.3em}{0ex}}\mathrm{km}142km (using only one-way classical communications with decoy states) to 181km181\phantom{\rule{0.3em}{0ex}}\mathrm{km}181km. The second scheme is able to achieve a 10% greater key generation rate in the whole regime of distances. We conclude that decoy-state QKD with two-way classical postprocessing is of practical interest.
Quantum key distribution (QKD) provides unconditional physical layer security for the distribution of encryption keys between legitimate parties. This paper presents a quantum key distribution protocol over a two-way quantum channel. This protocol does not require any classical communication channel for key sifting and key reconciliation. Utilizing the proposed protocol, one can reduce the overhead in the classical channel and increase the speed with which keys can be exchanged. Absence of a classical communication channel reduces operational overhead.
This work presents quantum key distribution protocols (QKDPs) to safeguard security in large networks, efficiency is improved as the proposed protocols contain the fewest number of communication rounds and two parties can share and use a long-term secret Key. Quantum cryptography is basically based on a trusted channel in communication between two parties compared to classical channel. Recently, Quantum Key Distribution (QKD) has become more secure transmission method used to transmit secret key between two legitimate parties. This paper discusses the implementation of (QKD) protocol with the existence of an eavesdropper. The implementation simulates the communication of two parties who wish to share a secret key with the existing of eavesdropper. The existing of eavesdropper is simulated with two kinds of attacks, which is used as parameter to measure the length of final key agreed by both authenticated parties at the end of the communication.