A short impossibility proof of quantum bit commitment
From MaRDI portal
Abstract: Bit commitment protocols, whose security is based on the laws of quantum mechanics alone, are generally held to be impossible on the basis of a concealment-bindingness tradeoff. A strengthened and explicit impossibility proof has been given in: G. M. D'Ariano, D. Kretschmann, D. Schlingemann, and R. F. Werner, Phys. Rev. A 76, 032328 (2007), in the Heisenberg picture and in a C*-algebraic framework, considering all conceivable protocols in which both classical and quantum information are exchanged. In the present paper we provide a new impossibility proof in the Schrodinger picture, greatly simplifying the classification of protocols and strategies using the mathematical formulation in terms of quantum combs, with each single-party strategy represented by a conditional comb. We prove that assuming a stronger notion of concealment--worst-case over the classical information histories--allows Alice's cheat to pass also the worst-case Bob's test. The present approach allows us to restate the concealment-bindingness tradeoff in terms of the continuity of dilations of probabilistic quantum combs with respect to the comb-discriminability distance.
Recommendations
- scientific article; zbMATH DE number 1283995
- scientific article; zbMATH DE number 1302858
- Perfectly concealing quantum bit commitment from any quantum one-way permutation
- An arbitrarily concealing and practically binding quantum bit commitment protocol
- Why quantum bit commitment and ideal quantum coin tossing are impossible.
Cites work
- scientific article; zbMATH DE number 845841 (Why is no real title available?)
- A continuity theorem for Stinespring's dilation
- Advances in cryptology - CRYPTO '95. 15th annual international cryptology conference, Santa Barbara, CA, USA, August 27-31, 1995. Proceedings
- General state changes in quantum theory
- On general minimax theorems
- Positive Functions on C ∗ -Algebras
- Quantum cryptography based on Bell’s theorem
- Secure classical bit commitment using fixed capacity communication channels
- The transition probability in the state space of a \(^*\)-algebra
- Theoretical framework for quantum networks
- Towards a general theory of quantum games
Cited in
(16)- Secure classical bit commitment using fixed capacity communication channels
- Quantum Bit Commitment with a Composite Evidence
- Cryptanalysis and improvement of Wu-Cai-Wu-Zhang's quantum private comparison protocol
- On the impossibility of non-static quantum bit commitment between two parties
- Quantum cryptography beyond quantum key distribution
- Unconditionally secure quantum bit commitment based on the uncertainty principle
- An arbitrarily concealing and practically binding quantum bit commitment protocol
- Energy requirement for implementing unitary gates on energy-unbounded systems
- Extremal generalized quantum measurements
- Remote preparation of arbitrary ensembles and quantum bit commitment
- New binding-concealing trade-offs for quantum string commitment
- Quantum cryptography: key distribution and beyond
- On the question of secret probability distributions in quantum bit commitment
- Quantum bit commitment and the reality of the quantum state
- Fidelity of quantum strategies with applications to cryptography
- Optimal quantum networks and one-shot entropies
This page was built for publication: A short impossibility proof of quantum bit commitment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2445974)
