Making An Empty Promise With A Quantum Computer

Abstract

Alice has made a decision in her mind. While she does not want to reveal it to Bob at this moment, she would like to convince Bob that she is committed to this particular decision and that she cannot change it at a later time. Is there a way for Alice to get Bob's trust? Until recently, researchers had believed that the above task can be performed with the help of quantum mechanics. And the security of the quantum scheme lies on the uncertainty principle. Nevertheless, such optimism was recently shattered by Mayers and by us, who found that Alice can always change her mind if she has a quantum computer. Here, we survey this dramatic development and its implications on the security of other quantum cryptographic schemes.

We have revised our paper to emphasize that the result applies to all bit commitment schemes (including ones with measurements). Besides, some minor inaccuracy was corrected

Cited by in corpus (15)

• Unconditional Security Of Quantum Key Distribution Over Arbitrarily Long Distances
• Entanglement sampling and applications
• Experimental implementation of bit commitment in the noisy-storage model
• Possibility, Impossibility and Cheat-Sensitivity of Quantum Bit String Commitment
• Oblivious transfer using quantum entanglement
• The quantum bit commitment theorem
• Quantum-Classical Complexity-Security Tradeoff In Secure Multi-Party Computation
• Quantum to Classical Randomness Extractors
• Quantum key distribution based on orthogonal states allows secure quantum bit commitment
• Simplified quantum bit commitment using single photon nonlocality
• Can relativistic bit commitment lead to secure quantum oblivious transfer?
• Unconditionally secure quantum bit commitment based on the uncertainty principle
• An optical implementation of quantum bit commitment using infinite-dimensional systems
• Quantum Bit Commitment with a Composite Evidence
• Unconditionally secure quantum coin flipping