Lower bounds for leader election and collective coin-flipping in the perfect information model
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Extracting all the randomness and reducing the error in Trevisan's extractors
Journal of Computer and System Sciences - STOC 1999
New Imperfect Random Source with Applications to Coin-Flipping
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Noncryptographic Selection Protocols
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Hardness of Approximating Minimization Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Randomization helps to perform independent tasks reliably
Random Structures & Algorithms
The round complexity of two-party random selection
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Lower bound for scalable Byzantine Agreement
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Fast asynchronous byzantine agreement and leader election with full information
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Fast asynchronous Byzantine agreement and leader election with full information
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |
In the leader election problem, n players wish to elect a random leader. The difficulty is that some coalition of players may conspire to elect one of its own members. We adopt the perfect information model: all communication is by broadcast, and the bad players have unlimited computational power. Within a round, they may also wait to see the inputs of the good players. A protocol is called resilient if a good leader is elected with probability bounded away from 0.We give a simple, constructive leader election protocol that is resilient against coalitions of size bn, for any b 2.