Add to ORKGWe show that a secure quantum protocol for coin tossing exist. The existence of quantum coin tossing support the conjecture of D.Mayers [Phys.Rev.Lett. 78, 3414(1997)] that only asymmetrical tasks as quantum bit commitment are impossible
Abstract Bit commitment involves the submission of evidence from one party to another so that the ev...
After a general introduction, the thesis is divided into four parts. In the first, we discuss the ta...
Quantum computing allows us to revisit the study of quantum cryptographic primitives with informatio...
In coin tossing two remote participants want to share a uniformly distributed random bit. At the lea...
There had been well-known claims of unconditionally secure quantum protocols for bit commitment. How...
We present a two-party protocol for quantum gambling. The protocol allows two remote parties to play...
We show that, if a quantum coin flip is combined with another quantum protocol, quantum bit escrow, ...
A relativistic quantum information exchange protocol is proposed allowing two distant users to reali...
We review the quantum version of a well known problem of cryptography called coin tossing (``flippin...
AbstractIn this paper, we introduce a new quantum bit commitment protocol which is secure against en...
We propose a coin-flip protocol which yields a string of strong, random coins and is fully simulatab...
AbstractWe present a new protocol and two lower bounds for quantum coin flipping. In our protocol, n...
International audienceThe cryptographic protocol of coin tossing consists of two parties, Alice and ...
We show that all proposed quantum bit commitment schemes are insecure because the sender, Alice, can...
International audiencePerforming complex cryptographic tasks will be an essential element in future ...
Abstract Bit commitment involves the submission of evidence from one party to another so that the ev...
After a general introduction, the thesis is divided into four parts. In the first, we discuss the ta...
Quantum computing allows us to revisit the study of quantum cryptographic primitives with informatio...
In coin tossing two remote participants want to share a uniformly distributed random bit. At the lea...
There had been well-known claims of unconditionally secure quantum protocols for bit commitment. How...
We present a two-party protocol for quantum gambling. The protocol allows two remote parties to play...
We show that, if a quantum coin flip is combined with another quantum protocol, quantum bit escrow, ...
A relativistic quantum information exchange protocol is proposed allowing two distant users to reali...
We review the quantum version of a well known problem of cryptography called coin tossing (``flippin...
AbstractIn this paper, we introduce a new quantum bit commitment protocol which is secure against en...
We propose a coin-flip protocol which yields a string of strong, random coins and is fully simulatab...
AbstractWe present a new protocol and two lower bounds for quantum coin flipping. In our protocol, n...
International audienceThe cryptographic protocol of coin tossing consists of two parties, Alice and ...
We show that all proposed quantum bit commitment schemes are insecure because the sender, Alice, can...
International audiencePerforming complex cryptographic tasks will be an essential element in future ...
Abstract Bit commitment involves the submission of evidence from one party to another so that the ev...
After a general introduction, the thesis is divided into four parts. In the first, we discuss the ta...
Quantum computing allows us to revisit the study of quantum cryptographic primitives with informatio...