Add to ORKGWe present a quantum protocol for the task of weak coin flipping. We find that for one choice of parameters in the protocol, the maximum probability of a dishonest party winning the coin flip if the other party is honest is 1/sqrt(2). We also examine the cheat-sensitivity of the protocol. In particular, we calculate the maximum probability of winning that a dishonest party can achieve without running any risk of being caught cheating
It is well known that unconditionally secure bit commitment is impossible even in the quantum world....
Quantum coin flipping is a cryptographic primitive in which two or more parties that do not trust ea...
In this paper, we present a loss-tolerant quantum strong coin flipping protocol with bias ε ≈ 0.359....
Each classical public-coin protocol for coin flipping is naturally associated with a quantum protoco...
AbstractWe present a new protocol and two lower bounds for quantum coin flipping. In our protocol, n...
We study the class of protocols for weak quantum coin flipping introduced by Spekkens and Rudolph (q...
Each classical public-coin protocol for coin flipping is naturally associated with a quantum protoco...
International audienceAs in modern communication networks, the security of quantum networks will rel...
AbstractWe present a new protocol and two lower bounds for quantum coin flipping. In our protocol, n...
Quantum protocols for coin flipping can be composed in series in such a way that a cheating party ga...
International audienceIn this article we show for the first time that quantum coin flipping with sec...
International audienceIn this article we show for the first time that quantum coin flipping with sec...
Quantum protocols for coin flipping can be composed in series in such a way that a cheating party ga...
International audienceIn this article we show for the first time that quantum coin flipping with sec...
Coin flipping is a cryptographic primitive in which two distrustful parties wish to generate a rando...
It is well known that unconditionally secure bit commitment is impossible even in the quantum world....
Quantum coin flipping is a cryptographic primitive in which two or more parties that do not trust ea...
In this paper, we present a loss-tolerant quantum strong coin flipping protocol with bias ε ≈ 0.359....
Each classical public-coin protocol for coin flipping is naturally associated with a quantum protoco...
AbstractWe present a new protocol and two lower bounds for quantum coin flipping. In our protocol, n...
We study the class of protocols for weak quantum coin flipping introduced by Spekkens and Rudolph (q...
Each classical public-coin protocol for coin flipping is naturally associated with a quantum protoco...
International audienceAs in modern communication networks, the security of quantum networks will rel...
AbstractWe present a new protocol and two lower bounds for quantum coin flipping. In our protocol, n...
Quantum protocols for coin flipping can be composed in series in such a way that a cheating party ga...
International audienceIn this article we show for the first time that quantum coin flipping with sec...
International audienceIn this article we show for the first time that quantum coin flipping with sec...
Quantum protocols for coin flipping can be composed in series in such a way that a cheating party ga...
International audienceIn this article we show for the first time that quantum coin flipping with sec...
Coin flipping is a cryptographic primitive in which two distrustful parties wish to generate a rando...
It is well known that unconditionally secure bit commitment is impossible even in the quantum world....
Quantum coin flipping is a cryptographic primitive in which two or more parties that do not trust ea...
In this paper, we present a loss-tolerant quantum strong coin flipping protocol with bias ε ≈ 0.359....