Conference paper
Decoding is really hard
J. Bruck, Moni Naor
ISIT 1990
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.
J. Bruck, Moni Naor
ISIT 1990
Cynthia Dwork, Moni Naor, et al.
STOC 1998
N. Alon, D. Kleitman, et al.
Graphs and Combinatorics
Ronald Fagin, A. Lotem, et al.
SIGMOD/PODS/ 2001