We examine a class of collective coin-flipping games that arises from randomized distributed algorithms with halting failures. In these games, a sequence of local coin flips is generated, which must be combined to form a single global coin flip. An adversary monitors the game and may attempt to bias its outcome by hiding the result of up to t local coin flips. We show that to guarantee at most constant bias,\Omega\Gamma t
|
1027
|
Distributed Algorithms
– Lynch
- 1996
|
|
498
|
Wait-Free Synchronization
– Herlihy
- 1991
|
|
206
|
On the minimal synchronism needed for distributed consensus
– Dolev, Dwork, et al.
- 1987
|
|
127
|
Memory Requirements for Agreement Among Unreliable Asynchronous Processes
– Loui, Abu-Amara
- 1987
|
|
98
|
Fast randomized consensus using shared memory
– Aspnes, Herlihy
- 1990
|
|
80
|
Optimal numbering and isoperimetric problems on graphs
– Harper
- 1966
|
|
69
|
On achieving consensus using a shared memory
– Abrahamson
- 1988
|
|
68
|
On Processor Coordination Using Asynchronous Hardware
– Chor, Israeli, et al.
- 1987
|
|
58
|
Collective coin flipping
– Ben-Or, Linial
- 1990
|
|
54
|
Impossibility of distributed commit with one faulty process
– Fischer, Lynch, et al.
- 1985
|
|
39
|
Optimal time randomized consensus - making resilient algorithms fast in practice
– Saks, Shavit, et al.
- 1991
|
|
38
|
On the bit extraction problem
– Friedman
- 1992
|
|
36
|
space-efficient randomized consensus
– Aspnes, Time-
- 1993
|
|
26
|
Bounded polynomial randomized consensus
– Attiya, Dolev, et al.
- 1989
|
|
26
|
On the space complexity of randomized synchronization
– Fich, Herlihy, et al.
- 1998
|
|
25
|
Efficient asynchronous consensus with the weak adversary scheduler
– Aumann
- 1997
|
|
23
|
Polylog randomized wait-free consensus
– Chandra
- 1996
|
|
20
|
Collective coin flipping, robust voting schemes and minima of Banzhaf values
– Ben-Or, Linial
- 1985
|
|
20
|
Towards a strong communication complexity theory or generating quasirandom sequences from two communicating slightly-random sources (extended abstract
– Vazirani
- 1985
|
|
19
|
A robust noncryptographic protocol for collective coin-flipping
– Saks
- 1989
|
|
15
|
Fast perfect-information leader-election protocols with linear immunity
– Cooper, Linial
- 1995
|
|
15
|
Some extremal problems arising from discrete control processes
– Lichtenstein, Linial, et al.
- 1989
|
|
14
|
Efficient asynchronous consensus with the value-oblivious adversary scheduler
– Aumann, Bender
- 1996
|
|
12
|
Coin-flipping games immune against linear-sized coalitions
– Alon, Naor
- 1993
|
|
12
|
Collective coin flipping and other models of imperfect randomness
– Ben-Or, Linial, et al.
- 1987
|
|
12
|
Randomized consensus in expected O(n log n) operations
– Bracha, Rachman
- 1991
|
|
11
|
Orli Waarts. Time-lapse snapshots
– Dwork, Herlihy, et al.
- 1999
|
|
7
|
Hagit Attiya, and Gadi Taubenfeld. Time-adaptive algorithms for syncronization
– Alur
- 1997
|
|
5
|
and Ophir Rachman. Approximated counters and randomized consensus
– Bracha
- 1990
|
|
3
|
Aspnes and Orli Waarts. Randomized consensus in O(n log n) operations per processor
– James
- 1996
|
|
2
|
bounds for distributed coin-flipping and randomized consensus
– Lower
- 1997
|
|
1
|
Martingales with Boolean final value must make jumps of O(1=n 1=2 ) with constant probability. Unpublished manuscript
– Cleve, Impagliazzo
- 1993
|
|
