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 Conference on Electrical and Control Engineering & Materials Science and Manufacturing (ECEMSM)

Quantum Bit Commitment Combining with BB84 Protocol

Zhang Linxi, Changhua Zhu, Nan Zhao, Changxing Pei

Published Mar 13, 2016• 0 citations
Publisher

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. The new scheme can be used to perform routing operation by which the source can be made sure that the virtual circuits it chosen doesn't influence on other relay routes in a large-scale trusted relay-based quantum network.

DOI
10.1142/9789813100312_0043

Related papers

Quantum Bit Commitment Combinbing with BB84 Protocol

Zhang Linxi, Changhua Zhu, Nan Zhao +1 more

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.

arXiv:1410.4297•Oct 16, 2014•0 citations

Topology-Abstraction-Based Protection Scheme in Quantum Key Distribution Networks with Partially Trusted Relays

Qin Zhang, Yikai Liu, Xiaosong Yu +2 more

Quantum key distribution (QKD) can protect the exchange process of confidential information between communicating parties. By using the basic principles of quantum mechanics and combined with “one-time pad” cipher encryption, information can be unconditionally secure. The BB84 protocol first describes the method of transmitting information by photon polarization state, and it expounds the transmission process of services between trusted relays. However, due to the defects of real experimental devices, there are security vulnerabilities in QKD in a real system. The birth of measurement-device-independent quantum key distribution (MDI-QKD) protocol solves the problem, providing immunity to hacker attacks at the end of the detector. It can enable both sides of the transmission service to establish a connection and generate secret keys through an untrusted relay node to ensure information security. However, the types and properties of link nodes in quantum key distribution network (QKDN) based on partially trusted relay are more complex, which can easily result in network fault. Therefore, how to prevent the impact of failure on QKDN has become an urgent problem. In this paper, we propose a protection scheme for QKDN with partially trusted relays. The method deals with trusted and untrusted relays differently and constructs the working and protection paths of the secret key for each service. It reduces resource conflict between the protection and working paths by establishing a key protection threshold, which realizes the resource trade-off between the two factors. Simulation results show that the scheme provides effective protection to the services, and it improves the stability and reliability of QKDN based on partially trusted relay.

Photonics•Apr 3, 2022•5 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

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

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

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
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. The new scheme can be used to perform routing operation by which the source can be made sure that the virtual circuits it chosen doesn't influence on other relay routes in a large-scale trusted relay-based quantum network.
Quantum key distribution (QKD) can protect the exchange process of confidential information between communicating parties. By using the basic principles of quantum mechanics and combined with “one-time pad” cipher encryption, information can be unconditionally secure. The BB84 protocol first describes the method of transmitting information by photon polarization state, and it expounds the transmission process of services between trusted relays. However, due to the defects of real experimental devices, there are security vulnerabilities in QKD in a real system. The birth of measurement-device-independent quantum key distribution (MDI-QKD) protocol solves the problem, providing immunity to hacker attacks at the end of the detector. It can enable both sides of the transmission service to establish a connection and generate secret keys through an untrusted relay node to ensure information security. However, the types and properties of link nodes in quantum key distribution network (QKDN) based on partially trusted relay are more complex, which can easily result in network fault. Therefore, how to prevent the impact of failure on QKDN has become an urgent problem. In this paper, we propose a protection scheme for QKDN with partially trusted relays. The method deals with trusted and untrusted relays differently and constructs the working and protection paths of the secret key for each service. It reduces resource conflict between the protection and working paths by establishing a key protection threshold, which realizes the resource trade-off between the two factors. Simulation results show that the scheme provides effective protection to the services, and it improves the stability and reliability of QKDN based on partially trusted relay.
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.
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.
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.
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.