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
DOI
10.1142/9789813100312_0043

Related papers

Quantum key agreement protocol based on BB84

Song‐Kong Chong, Tzonelih Hwang

Optics Communications•Nov 28, 2009•213 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

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

Practical quantum bit commitment protocol

Ariel Danan, Lev Vaidman A

arXiv:1202.3331•Quantum Information Processing•Aug 31, 2011•24 citations

Statistically-Secure Bit Commitment and Coin Flipping Protocols Based on Quantum Hardware Assumptions

Roo Dunnill, Mina Doosti

Bit commitment is impossible to achieve with unconditional security, even in quantum cryptogra- phy. We show that statistically secure bit commitment, satisfying both hiding and binding, can be constructed from hybrid locked physical unclonable functions (HLPUFs), a hardware primitive that combines classical hardware tokens and quantum communication. Our protocol uses these hardware assumptions in a novel and non-trivial way to achieve the first mistrustful two-party cryptographic protocol based on hybrid hardware modules. We prove statistical hiding and binding under natu- ral assumptions on the HLPUF and using a carefully designed challenge generation algorithm as a subroutine of our bit-commitment protocol. The construction also yields the first hardware-based coin-flipping protocol. Our results suggest a new paradigm for secure two-party cryptography in quantum networks, combining rigorous security guarantees with a concrete route toward practical implementation.

quant-pharXiv:2608.11187•Aug 12, 2026•0 citations

Quantum cryptography

Dagmar Bruß, Gábor Erdélyi, Tim Meyer +2 more

We survey some results in quantum cryptography. After a brief introduction to classical cryptography, we provide the quantum-mechanical background needed to present some fundamental protocols from quantum cryptography. In particular, we review quantum key distribution via the BB84 protocol and its security proof, as well as the related quantum bit commitment protocol and its proof of insecurity.

ACM Computing Surveys•Jul 6, 2007•77 citations
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.
Bit commitment is impossible to achieve with unconditional security, even in quantum cryptogra- phy. We show that statistically secure bit commitment, satisfying both hiding and binding, can be constructed from hybrid locked physical unclonable functions (HLPUFs), a hardware primitive that combines classical hardware tokens and quantum communication. Our protocol uses these hardware assumptions in a novel and non-trivial way to achieve the first mistrustful two-party cryptographic protocol based on hybrid hardware modules. We prove statistical hiding and binding under natu- ral assumptions on the HLPUF and using a carefully designed challenge generation algorithm as a subroutine of our bit-commitment protocol. The construction also yields the first hardware-based coin-flipping protocol. Our results suggest a new paradigm for secure two-party cryptography in quantum networks, combining rigorous security guarantees with a concrete route toward practical implementation.