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:1410.4297

Quantum Bit Commitment Combinbing with BB84 Protocol

Zhang Linxi, Changhua Zhu, Nan Zhao, Changxing Pei

Published Oct 16, 2014• 0 citations
arXivHTMLPDF

Abstract

We proposed a new quantum bit commitment scheme in which secret key need not to be provided by other quantum key distribution system. We can get the bit commitment with probability p by adding a waiting time in a frame during operating the BB84 protocol. Then the measurement outcomes can be encrypted by one-time pad with the key generated by BB84 protocol. We can also obtain the redundant secret keys to encrypt other information in this quantum key distribution system.

DOI
10.48550/arxiv.1410.4297

Related papers

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

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

Harnessing closed timelike curves for cryptographic protocols

Soumik Ghosh, Arnab Adhikary, Goutam Paul

Quantum bit commitment and Quantum Key Distribution (QKD) are the building blocks of secure quantum cryptographic protocols. Of the numerous QKD schemes, the BB84 protocol was the first one proposed and it is also the most popular. Bennett and Brassard, in their 1984 paper, proposed both quantum bit commitment and the BB84 scheme of QKD. However, their scheme for bit commitment was later shown to be vulnerable to an EPR attack. Also, in a world with Deutschian Closed Timelike Curves (D-CTCs), the BB84 protocol can be broken as the eavesdropper can intercept whatever key the two parties communicate with each other using a circuit which detects non-orthogonal quantum states. Later, the idea of this circuit was extended using Postselected Closed Timelike Curves (P-CTCs), a second variant of CTCs. In this paper, we first propose a secure quantum bit commitment protocol using the Deutschian model of closed timelike curves. Then, we take up the BB84 protocol and propose a secure version of the protocol, transforming it to an entanglement based scheme using the postselected model of closed timelike curves. In short, we show that in the presence of Closed Timelike Curves, unconditionally secure quantum bit commitment and secure quantum key distribution are both possible.

•Aug 11, 2017•0 citations

Modified BB84 Quantum Key Distribution Protocol Using Legendre Symbol

Alharith A. Abdullah, Rifaat Z. Khalaf, Hamza B. Habib

Quantum key distribution is considered as one of the safe ways of distributing keys among the frames employed in communication. In 1984, BB84 appeared first as a protocol for QKD. In the present study paper, we proposed a new way of encoding a stream of bits into polarized photons using Legendre Symbol (a/p), where both of the sender and the receiver negotiate of using the function of Legendre symbol. Hence, in this case the proposed protocol uses only quantum channel instead of the classical channel, this leads to less time spent and less quantum error rate occurring comparing with the previous BB84 protocol. The experimental outcome confirms that the proposed protocol delivers efficient results comparing with the original BB84 protocol.

Scientific Conference of Computer Sciences (SCCS)•Mar 1, 2019•10 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

Unconditionally Secure Bit Commitment by Transmitting Measurement Outcomes

Adrian Kent

We propose a new unconditionally secure bit commitment scheme based on Minkowski causality and the properties of quantum information. The receiving party sends a number of randomly chosen Bennett-Brassard 1984 (BB84) qubits to the committer at a given point in space-time. The committer carries out measurements in one of the two BB84 bases, depending on the committed bit value, and transmits the outcomes securely at (or near) light speed in opposite directions to remote agents. These agents unveil the bit by returning the outcomes to adjacent agents of the receiver. The protocol's security relies only on simple properties of quantum information and the impossibility of superluminal signalling.

arXiv:1108.2879•Physical Review Letters•Sep 27, 2012•123 citations
We proposed a new quantum bit commitment scheme in which secret key need not to be provided by other quantum key distribution system. We can get the bit commitment with probability p by adding a waiting time in a frame during operating the BB84 protocol. Then the measurement outcomes can be encrypted by one-time pad with the key generated by BB84 protocol. We can also obtain the redundant secret keys to encrypt other information in this quantum key distribution system.
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.
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.
Quantum bit commitment and Quantum Key Distribution (QKD) are the building blocks of secure quantum cryptographic protocols. Of the numerous QKD schemes, the BB84 protocol was the first one proposed and it is also the most popular. Bennett and Brassard, in their 1984 paper, proposed both quantum bit commitment and the BB84 scheme of QKD. However, their scheme for bit commitment was later shown to be vulnerable to an EPR attack. Also, in a world with Deutschian Closed Timelike Curves (D-CTCs), the BB84 protocol can be broken as the eavesdropper can intercept whatever key the two parties communicate with each other using a circuit which detects non-orthogonal quantum states. Later, the idea of this circuit was extended using Postselected Closed Timelike Curves (P-CTCs), a second variant of CTCs. In this paper, we first propose a secure quantum bit commitment protocol using the Deutschian model of closed timelike curves. Then, we take up the BB84 protocol and propose a secure version of the protocol, transforming it to an entanglement based scheme using the postselected model of closed timelike curves. In short, we show that in the presence of Closed Timelike Curves, unconditionally secure quantum bit commitment and secure quantum key distribution are both possible.
Quantum key distribution is considered as one of the safe ways of distributing keys among the frames employed in communication. In 1984, BB84 appeared first as a protocol for QKD. In the present study paper, we proposed a new way of encoding a stream of bits into polarized photons using Legendre Symbol (a/p), where both of the sender and the receiver negotiate of using the function of Legendre symbol. Hence, in this case the proposed protocol uses only quantum channel instead of the classical channel, this leads to less time spent and less quantum error rate occurring comparing with the previous BB84 protocol. The experimental outcome confirms that the proposed protocol delivers efficient results comparing with the original BB84 protocol.
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.
We propose a new unconditionally secure bit commitment scheme based on Minkowski causality and the properties of quantum information. The receiving party sends a number of randomly chosen Bennett-Brassard 1984 (BB84) qubits to the committer at a given point in space-time. The committer carries out measurements in one of the two BB84 bases, depending on the committed bit value, and transmits the outcomes securely at (or near) light speed in opposite directions to remote agents. These agents unveil the bit by returning the outcomes to adjacent agents of the receiver. The protocol's security relies only on simple properties of quantum information and the impossibility of superluminal signalling.