Sciweavers

40 search results - page 1 / 8
» Can Random Coin Flips Speed Up a Computer
Sort
View
CORR
2010
Springer
68views Education» more  CORR 2010»
13 years 5 months ago
Can Random Coin Flips Speed Up a Computer?
David Zuckerman
FOCS
2009
IEEE
13 years 8 months ago
Optimal Quantum Strong Coin Flipping
Coin flipping is a fundamental cryptographic primitive that enables two distrustful and far apart parties to create a uniformly random bit [Blu81]. Quantum information allows for ...
André Chailloux, Iordanis Kerenidis
STOC
1997
ACM
91views Algorithms» more  STOC 1997»
13 years 9 months ago
Lower Bounds for Distributed Coin-Flipping and Randomized Consensus
We examine a class of collective coin- ipping games that arises from randomized distributed algorithms with halting failures. In these games, a sequence of local coin ips is gener...
James Aspnes
ICQNM
2008
IEEE
201views Chemistry» more  ICQNM 2008»
13 years 11 months ago
Loss-Tolerant Quantum Coin Flipping
Coin flipping is a cryptographic primitive in which two spatially separated players, who in principle do not trust each other, wish to establish a common random bit. If we limit ...
Guido Berlín, Gilles Brassard, Félix...