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

Lecture notes in computer science

Quantum Bit Commitment with Application in Quantum Zero-Knowledge Proof (Extended Abstract)

Jun Yan, Jian Weng, Dongdai Lin, Yu-Juan Quan

Published Jan 1, 2015• 16 citations
Publisher
DOI
10.1007/978-3-662-48971-0_47

Related papers

On the Existence of Bit Commitment Schemes and Zero-Knowledge Proofs

Ivan Damgård

Springer eBooks•Nov 8, 2007•59 citations

General Properties of Quantum Bit Commitments (Extended Abstract)

Jun Yan

Lecture notes in computer science•Jan 1, 2022•26 citations

Zero-Knowledge Proofs and String Commitments Withstanding Quantum Attacks

Ivan Damgård, Serge Fehr, Louis Salvail

Lecture notes in computer science•Jan 1, 2004•49 citations

Relativistic commitment and zero-knowledge proofs

André Chailloux

•Mar 1, 2018•0 citations

Quantum Bit Commitment with Application in Quantum Zero-Knowledge Proof.

Dongdai Lin, Yu-Juan Quan, Jian Weng +1 more

Watrous (STOC 2006) proved that plugging classical bit commitment scheme that is secure against quantum attack into the GMW-type construction of zero-knowledge gives a classical zero-knowledge proof that is secure against quantum attack. In this paper, we showed that plugging quantum bit commitment scheme (allowing quantum computation and communication) into the GMW-type construction also gives a quantum zero-knowledge proof, as one expects. However, since the binding condition of quantum bit commitment scheme is inherently different from its classical counterpart, compared with Watrous ’ security proof, here we encounter new difficulty in soundness analysis. To overcome the difficulty, we take a geometric approach, managing to reduce quantum soundness analysis to classical soundness analysis. We also propose a formalization of non-interactive quantum bit commitment scheme, which may come in handy in other places. Moreover, inspired by our formalization, we generalize Naor’s construction of bit commitment scheme to the quantum setting, achieving non-interactive commit stage. We hope quantum bit commitment scheme can find more applications in quantum cryptog-raphy. 1

•Jan 1, 2014•1 citation

A short impossibility proof of quantum bit commitment

Giulio Chiribella, Giacomo Mauro D’Ariano, Paolo Perinotti +2 more

arXiv:0905.3801•Physics Letters A•Feb 28, 2013•38 citations
Watrous (STOC 2006) proved that plugging classical bit commitment scheme that is secure against quantum attack into the GMW-type construction of zero-knowledge gives a classical zero-knowledge proof that is secure against quantum attack. In this paper, we showed that plugging quantum bit commitment scheme (allowing quantum computation and communication) into the GMW-type construction also gives a quantum zero-knowledge proof, as one expects. However, since the binding condition of quantum bit commitment scheme is inherently different from its classical counterpart, compared with Watrous ’ security proof, here we encounter new difficulty in soundness analysis. To overcome the difficulty, we take a geometric approach, managing to reduce quantum soundness analysis to classical soundness analysis. We also propose a formalization of non-interactive quantum bit commitment scheme, which may come in handy in other places. Moreover, inspired by our formalization, we generalize Naor’s construction of bit commitment scheme to the quantum setting, achieving non-interactive commit stage. We hope quantum bit commitment scheme can find more applications in quantum cryptog-raphy. 1