Insecurity of Quantum Bit Commitment with Secret Parameters

Abstract

The impossibility proof of unconditionally secure quantum bit commitment is crucially dependent on the assertion that Bob is not allowed to generate probability distributions unknown to Alice. This assertion is actually not meaningful, because Bob can always cheat without being detected. In this paper we prove that, for any concealing protocol involving secret probability distributions, there exists a cheating unitary transformation that is known to Alice. Our result closes a gap in the original impossibility proof.

8 pages, 0 figure, REVTEX 4

References in corpus (3)

• Unconditionally secure quantum bit commitment is impossible
• Is Quantum Bit Commitment Really Possible?
• Why Quantum Bit Commitment And Ideal Quantum Coin Tossing Are Impossible

Cited by in corpus (6)

• Unconditionally secure quantum bit commitment based on the uncertainty principle
• An optical implementation of quantum bit commitment using infinite-dimensional systems
• On the question of secret probability distributions in quantum bit commitment
• MLC No-go Theorems: Reinterpretation and Extension
• Quantum oblivious transfer: a short review
• Cryptanalysis and improvement of Wu-Cai-Wu-Zhang's quantum private comparison protocol