Zobrazeno 1 - 10
of 312
pro vyhledávání: '"Quantum coin tossing"'
Autor:
Zhao, Liangyuan, Yin, Zhenqiang, Wang, Shuang, Chen, Wei, Chen, Hua, Guo, Guangcan, Han, Zhengfu
Publikováno v:
Physical Review A 92, 062327(2015)
Quantum coin tossing (QCT) is an important primitive of quantum cryptography and has received continuous interest. However, in practical QCT, Bob's detectors can be subjected to detector-side channel attacks launched by dishonest Alice, which will po
Externí odkaz:
http://arxiv.org/abs/1512.09269
Publikováno v:
Phys. Rev. Lett. 94, 040501 (2005)
In this letter we present the first implementation of a quantum coin tossing protocol. This protocol belongs to a class of ``two-party'' cryptographic problems, where the communication partners distrust each other. As with a number of such two-party
Externí odkaz:
http://arxiv.org/abs/quant-ph/0404027
Autor:
Barrett, Jonathan, Massar, Serge
Publikováno v:
Phys. Rev. A 69, 022322 (2004)
We discuss the security implications of noise for quantum coin tossing protocols. We find that if quantum error correction can be used, so that noise levels can be made arbitrarily small, then reasonable security conditions for coin tossing can be fr
Externí odkaz:
http://arxiv.org/abs/quant-ph/0303182
Autor:
Leslau, Boaz
We suggest an attack on a symmetric non-ideal quantum coin-tossing protocol suggested by Mayers Salvail and Chiba-Kohno. The analysis of the attack shows that the protocol is insecure.
Comment: 11 pages 1 figure,equations (29) and (30) changed
Comment: 11 pages 1 figure,equations (29) and (30) changed
Externí odkaz:
http://arxiv.org/abs/quant-ph/0104075
Autor:
Lo, H. -K., Chau, H. F.
Publikováno v:
Physica D120 (1998) 177-187
There had been well known claims of unconditionally secure quantum protocols for bit commitment. However, we, and independently Mayers, showed that all proposed quantum bit commitment schemes are, in principle, insecure because the sender, Alice, can
Externí odkaz:
http://arxiv.org/abs/quant-ph/9711065
In coin tossing two remote participants want to share a uniformly distributed random bit. At the least in the quantum version, each participant test whether or not the other has attempted to create a bias on this bit. It is requested that, for b = 0,
Externí odkaz:
http://arxiv.org/abs/quant-ph/9904078
Autor:
Doescher, C., Keyl, M.
We review the quantum version of a well known problem of cryptography called coin tossing (``flipping a coin via telephone''). It can be regarded as a game where two remote players (who distrust each other) tries to generate a uniformly distributed r
Externí odkaz:
http://arxiv.org/abs/quant-ph/0206088
An unconditionally secure quantum cion tossing protocol for two remote participants via entangled swapping is presented. The security of this protocol is guaranteed by the nonlocal property of quantum entanglement and the classical complexity.
C
C
Externí odkaz:
http://arxiv.org/abs/quant-ph/0012139
We 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.
Commen
Commen
Externí odkaz:
http://arxiv.org/abs/quant-ph/9706046
Autor:
Molotkov, S. N., Nazin, S. S.
A relativistic quantum information exchange protocol is proposed allowing two distant users to realize ``coin tossing'' procedure. The protocol is based on the point that in relativistic quantum theory reliable distinguishing between the two orthogon
Externí odkaz:
http://arxiv.org/abs/quant-ph/9910034