Suppose that n players want to elect a random leader and they communicate by posting messages to a common broadcast channel. This problem is called leader election, and it is fundamental to the distributed systems and cryptography literature. Recently, it has attracted renewed interests due to its p...
Keywords:
cryptographic protocols / game theory, leader election, multi-party computation, extractor, round complexity
