Coin-flipping games immune against linear-sized coalitions

It is proved that for every c<1 there are perfect-information coin-flipping and leader-election games on n players in which no coalition of cn players can influence the outcome with probability greater than some universal constant times c. It is shown that a random protocol of a certain length has this property, and an explicit construction is given as well.<<ETX>>

[1]  Cynthia Dwork,et al.  Randomization in Byzantine Agreement , 1989, Adv. Comput. Res..

[2]  Michael E. Saks.  A Robust Noncryptographic Protocol for Collective Coin Flipping , 1989, SIAM J. Discret. Math..

[3]  Noga Alon,et al.  Eigenvalues, geometric expanders, sorting in rounds, and ramsey theory , 1986, Comb..

[4]  Nathan Linial,et al.  The influence of variables on Boolean functions , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[5]  Gabriel Bracha,et al.  An O(log n) expected rounds randomized byzantine generals protocol , 1987, JACM.

[6]  Noga Alon,et al.  Biased Coins and Randomized Algorithms , 1989, Advances in Computational Research.

[7]  Andrew Chi-Chih Yao,et al.  On the improbability of reaching Byzantine agreements , 1989, STOC '89.

[8]  Vijay V. Vazirani,et al.  Random polynomial time is equal to slightly-random polynomial time , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[9]  Noga Alon,et al.  Legitimate colorings of projective planes , 1989, Graphs Comb..

[10]  Nathan Linial,et al.  Collective coin flipping, robust voting schemes and minima of Banzhaf values , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[11]  Nathan Linial,et al.  Collective Coin Flipping , 1989, Adv. Comput. Res..