We show that, if a quantum coin flip is combined with another quantum protocol, quantum bit escrow, as a subroutine to realize a cheat sensitive quantum bit commitment, a nontrivial cheating strategy frequently becomes possible. This cheating strategy, where a dishonest party takes advantage of the classical and/or quantum information transmitted in the quantum coin flip, is so powerful that the dishonest party recovers even maximal quantum entanglement from the quantum state once the dishonest party collapsed, whenever the dishonest party loses the coin flip
Abstract Bit commitment involves the submission of evidence from one party to another so that the ev...
It has been recently shown by Mayers that no bit commitment is secure if the participants have unlim...
Unconditionally secure non-relativistic bit commitment is known to be impossible in both the classic...
We show that all proposed quantum bit commitment schemes are insecure because the sender, Alice, can...
It is well known that unconditionally secure bit commitment is impossible even in the quantum world....
AbstractIn this paper, we introduce a new quantum bit commitment protocol which is secure against en...
It is well known that unconditionally secure bit commitment is impossible even in the quantum world....
There had been well-known claims of unconditionally secure quantum protocols for bit commitment. How...
We show that a secure quantum protocol for coin tossing exist. The existence of quantum coin tossing...
Unconditionally secure two-party bit commitment based solely on the principles of quantum mechanics ...
Quantum protocols for coin flipping can be composed in series in such a way that a cheating party ga...
Quantum computing allows us to revisit the study of quantum cryptographic primitives with informatio...
Unconditionally secure nonrelativistic bit commitment is known to be impossible in both the classica...
The Mayers-Lo-Chau theorem establishes that no quantum bit commitment protocol is unconditionally se...
We present a two-party protocol for quantum gambling. The protocol allows two remote parties to play...
Abstract Bit commitment involves the submission of evidence from one party to another so that the ev...
It has been recently shown by Mayers that no bit commitment is secure if the participants have unlim...
Unconditionally secure non-relativistic bit commitment is known to be impossible in both the classic...
We show that all proposed quantum bit commitment schemes are insecure because the sender, Alice, can...
It is well known that unconditionally secure bit commitment is impossible even in the quantum world....
AbstractIn this paper, we introduce a new quantum bit commitment protocol which is secure against en...
It is well known that unconditionally secure bit commitment is impossible even in the quantum world....
There had been well-known claims of unconditionally secure quantum protocols for bit commitment. How...
We show that a secure quantum protocol for coin tossing exist. The existence of quantum coin tossing...
Unconditionally secure two-party bit commitment based solely on the principles of quantum mechanics ...
Quantum protocols for coin flipping can be composed in series in such a way that a cheating party ga...
Quantum computing allows us to revisit the study of quantum cryptographic primitives with informatio...
Unconditionally secure nonrelativistic bit commitment is known to be impossible in both the classica...
The Mayers-Lo-Chau theorem establishes that no quantum bit commitment protocol is unconditionally se...
We present a two-party protocol for quantum gambling. The protocol allows two remote parties to play...
Abstract Bit commitment involves the submission of evidence from one party to another so that the ev...
It has been recently shown by Mayers that no bit commitment is secure if the participants have unlim...
Unconditionally secure non-relativistic bit commitment is known to be impossible in both the classic...