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

International Journal of Security and Networks

Improving efficiency of quantum key distribution with probabilistic measurements

Abhishek Parakh, Pramode K. Verma, Mahadevan Subramaniam

Published Jan 1, 2016• 4 citations
Publisher

Abstract

The first part of this paper 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. In the second part of the paper, we apply the probabilistic model to BB84 and show how it can be used to improve the efficiency of BB84.

DOI
10.1504/ijsn.2016.075075

Related papers

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

An Efficient Key Distribution Protocol Based on BB84

Parag K. Lala

Private key cryptography suffers from a major weakness - it requires sharing of a secret key between two parties. An intruder can copy the secret key as it is being exchanged, thereby severely compromising the security of the system. Thus a private key cryptographic system depends entirely on secrecy of the key. Public key cryptography does not have a key distribution problem but its security relies on the fact that determining the factors of a number that is the product of two very large prime numbers is not computationally feasible. It has been shown that a quantum computer can solve the prime factors of very large numbers in polynomial time which would otherwise take millions of years. Public key cryptography will therefore become insecure if quantum computing becomes a reality. Quantum cryptography, originally presented in BB84 protocol, avoids all these issues by encrypting the shared key using a series of photons. In this paper a key distribution protocol based on the concepts of BB84 is proposed It provides an additional layer of security by sending the key data bits twice; during the second transmission the original key bits or their complements are randomly chosen for transmission. The sender informs the receiver about the orientation of the key bits during the second round of transmission only after the data has been sent out.

American Journal of Computing Research Repository•Jan 23, 2014•0 citations

Deterministic and Efficient Quantum Key Distribution Using Entanglement Parity Bits and Ancillary Qubits

Muneer Alshowkan, Khaled M. Elleithy

In this paper, we propose an efficient and deterministic quantum key distribution protocol for establishing a secret key between two untrusted users. In this protocol, a secret key is distributed to a sender and a receiver who share entangled states with a third trusted party but not with each other. This secret key is distributed by the means of special pure quantum states using remote state preparation and controlled gates. In addition, we employ the parity bits of the entangled pairs and the ancillary states to assist in preparing and measuring the secret states. Distributing a state to two users requires two maximally entangled pairs as the quantum channel and a two-particle von Neumann projective measurement. The proposed protocol is exact and deterministic. It distributes a secret key of d qubits by the means of 2d entangled pairs and, on average, d bits of classical communication. We demonstrate the security of this protocol against entanglement attacks and present a method of privacy amplification.

IEEE Access•Jan 1, 2017•3 citations

QUANTUM KEY DISTRIBUTION SCHEME: AN IMPROVEMENT BASED ON BB84 PROTOCOL

Kausik Saha

Cryptography is being introduced to secure data. Through Classical Cryptographic technique, we can encrypt our data and secure secret key also. But classical cryptography is based on mathematical techniques where reversing one-way function is possible with sufficient computing power and time. So, Quantum Cryptography is introduced to overcome those drawbacks of traditional classical cryptography. It is based on the values of quantum mechanics and photon. Scientists and researchers have brought up a new key distribution protocol based on Quantum Cryptography is called Quantum Key Distribution (QKD) Protocol. The first QKD protocol BB84 was introduced by Charles Bennett and Gilles Brassard in 1984. After that several QKD protocols have been created. In this paper we have improved BB84 Protocol by removing the drawbacks of the existing algorithm towards Eavesdropping which may not be detected or disclosing large portion of secret key. Steps of the existing BB84 algorithm along with the modified one is described in detail with example and pseudo code. Limitations of BB84 and comparative study of both the existing and the improved one based on their security has been made and described in this current work.

International Journal of Advanced Research in Computer Science•Apr 20, 2018•1 citation

Probabilistic Model-Checking of Quantum Protocols (Extended Abstract)

Rajagopal Nagarajan, Nickolas K. Papanikolaou

In the 1980s it was first realized that quantum–mechanical phenomena can be exploited directly for the manipulation, storage and transmission of information. The discovery of quantum algorithms for prime factorization [18] and unstructured search [7], which outperformed the best classical algorithms for these tasks significantly, opened up new vistas for computer science and gave an initial thrust to the emerging field of quantum computation. To implement a quantum algorithm, however, a large scale quantum computer is necessary and such a device has yet to be built. Research in quantum information, on the other hand, has shown that quantum effects can be harnessed to provide efficient and highly secure communication channels, which can be built using current technology. Entangled quantum states, superpositions and quantum measurement are among the characteristics of the subatomic world which nature puts at our disposal; these and related phenomena enable the development of novel techniques for computation and communication with no rival in classical computing and communication theory. The focus in this paper is on communication protocols involving the use of such phenomena. Quantum protocols have particularly important applications in cryptography. Several quantum protocols have been proposed for cryptographic tasks such as oblivious transfer, bit commitment and key distribution [8,13]. The BB84 protocol for quantum key distribution [2,14], which allows two users to establish a common secret key using a single quantum channel, has been shown to be unconditionally secure against all attacks [11]. Other quantum protocols include procedures for

•Jan 1, 2005•0 citations

A Simulation of Quantum Key Distribution Using BB84 Protocol

Ahsan Manzoor, Muhammad Saeed, Faheem Ahmed

Secure communication in cryptographic system, relies on secret key which must be exchanged between a sender and a receiver such that it avoids unauthorized access and can be used to encrypt the plain text and decrypt the cipher text. However, advancement in quantum computing raises concern on the security of information exchanged over the web. As the information on the web is made secure using classical cryptographic mechanisms that are only computationally secure and quantum computers with high computational capability can generate the secrete keys in a very short time. In order to make sure that quantum computers do not breach the security of the network, we need to develop some sort of quantum-resistant mechanisms. Quantum key distribution is one of the quantum-resistant-mechanisms which guarantee secure data communication. It leverages quantum mechanics principles by exchanging the key in quantum states called qubits and any attempt to access the key causes disturbance in the qubits yielding change in their behavior or state, hence signaling the presence of an intruder and making it impossible to be accessed. This paper presents a simulation to establish and exchange secrete keys in quantum environment using BB84 protocol and to determine the efficiency of the system, quantum bit error rate is measured and discussed.

International Multi-Topic ICT Conference (IMTIC)•Dec 29, 2025•0 citations
The first part of this paper 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. In the second part of the paper, we apply the probabilistic model to BB84 and show how it can be used to improve the efficiency of BB84.
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.
Private key cryptography suffers from a major weakness - it requires sharing of a secret key between two parties. An intruder can copy the secret key as it is being exchanged, thereby severely compromising the security of the system. Thus a private key cryptographic system depends entirely on secrecy of the key. Public key cryptography does not have a key distribution problem but its security relies on the fact that determining the factors of a number that is the product of two very large prime numbers is not computationally feasible. It has been shown that a quantum computer can solve the prime factors of very large numbers in polynomial time which would otherwise take millions of years. Public key cryptography will therefore become insecure if quantum computing becomes a reality. Quantum cryptography, originally presented in BB84 protocol, avoids all these issues by encrypting the shared key using a series of photons. In this paper a key distribution protocol based on the concepts of BB84 is proposed It provides an additional layer of security by sending the key data bits twice; during the second transmission the original key bits or their complements are randomly chosen for transmission. The sender informs the receiver about the orientation of the key bits during the second round of transmission only after the data has been sent out.
In this paper, we propose an efficient and deterministic quantum key distribution protocol for establishing a secret key between two untrusted users. In this protocol, a secret key is distributed to a sender and a receiver who share entangled states with a third trusted party but not with each other. This secret key is distributed by the means of special pure quantum states using remote state preparation and controlled gates. In addition, we employ the parity bits of the entangled pairs and the ancillary states to assist in preparing and measuring the secret states. Distributing a state to two users requires two maximally entangled pairs as the quantum channel and a two-particle von Neumann projective measurement. The proposed protocol is exact and deterministic. It distributes a secret key of d qubits by the means of 2d entangled pairs and, on average, d bits of classical communication. We demonstrate the security of this protocol against entanglement attacks and present a method of privacy amplification.
Cryptography is being introduced to secure data. Through Classical Cryptographic technique, we can encrypt our data and secure secret key also. But classical cryptography is based on mathematical techniques where reversing one-way function is possible with sufficient computing power and time. So, Quantum Cryptography is introduced to overcome those drawbacks of traditional classical cryptography. It is based on the values of quantum mechanics and photon. Scientists and researchers have brought up a new key distribution protocol based on Quantum Cryptography is called Quantum Key Distribution (QKD) Protocol. The first QKD protocol BB84 was introduced by Charles Bennett and Gilles Brassard in 1984. After that several QKD protocols have been created. In this paper we have improved BB84 Protocol by removing the drawbacks of the existing algorithm towards Eavesdropping which may not be detected or disclosing large portion of secret key. Steps of the existing BB84 algorithm along with the modified one is described in detail with example and pseudo code. Limitations of BB84 and comparative study of both the existing and the improved one based on their security has been made and described in this current work.
In the 1980s it was first realized that quantum–mechanical phenomena can be exploited directly for the manipulation, storage and transmission of information. The discovery of quantum algorithms for prime factorization [18] and unstructured search [7], which outperformed the best classical algorithms for these tasks significantly, opened up new vistas for computer science and gave an initial thrust to the emerging field of quantum computation. To implement a quantum algorithm, however, a large scale quantum computer is necessary and such a device has yet to be built. Research in quantum information, on the other hand, has shown that quantum effects can be harnessed to provide efficient and highly secure communication channels, which can be built using current technology. Entangled quantum states, superpositions and quantum measurement are among the characteristics of the subatomic world which nature puts at our disposal; these and related phenomena enable the development of novel techniques for computation and communication with no rival in classical computing and communication theory. The focus in this paper is on communication protocols involving the use of such phenomena. Quantum protocols have particularly important applications in cryptography. Several quantum protocols have been proposed for cryptographic tasks such as oblivious transfer, bit commitment and key distribution [8,13]. The BB84 protocol for quantum key distribution [2,14], which allows two users to establish a common secret key using a single quantum channel, has been shown to be unconditionally secure against all attacks [11]. Other quantum protocols include procedures for
Secure communication in cryptographic system, relies on secret key which must be exchanged between a sender and a receiver such that it avoids unauthorized access and can be used to encrypt the plain text and decrypt the cipher text. However, advancement in quantum computing raises concern on the security of information exchanged over the web. As the information on the web is made secure using classical cryptographic mechanisms that are only computationally secure and quantum computers with high computational capability can generate the secrete keys in a very short time. In order to make sure that quantum computers do not breach the security of the network, we need to develop some sort of quantum-resistant mechanisms. Quantum key distribution is one of the quantum-resistant-mechanisms which guarantee secure data communication. It leverages quantum mechanics principles by exchanging the key in quantum states called qubits and any attempt to access the key causes disturbance in the qubits yielding change in their behavior or state, hence signaling the presence of an intruder and making it impossible to be accessed. This paper presents a simulation to establish and exchange secrete keys in quantum environment using BB84 protocol and to determine the efficiency of the system, quantum bit error rate is measured and discussed.