Perfect Information Leader Election in log* n+O (1) Rounds

@article{Russell2001PerfectIL,
  title={Perfect Information Leader Election in log* n+O (1) Rounds},
  author={Alexander Russell and David Zuckerman},
  journal={J. Comput. Syst. Sci.},
  year={2001},
  volume={63},
  pages={612-626}
}
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. Protocols proceed in rounds: although players are synchronized between rounds, within each round the bad players may wait to see the inputs of the good players. A protocol is called resilient if a… 

Figures from this paper

Game-Theoretically Fair Leader Election in O(log log n) Rounds under Majority Coalitions

TLDR
This work is the first exploration of the round complexity of game- theoretically fair leader election in the presence of a possibly majority coalition, and suggests a new, approximate game-theoretic fairness notion, called “approximate sequential fairness”, which provides a more desirable solution concept than some previously studied approximate fairness notions.

Game-Theoretic Fairness Meets Multi-party Protocols: The Case of Leader Election

TLDR
This work is the first exploration of the round complexity of game- theoretically fair leader election in the presence of a possibly majority coalition, and suggests a new, approximate game-theoretic fairness notion, called “approximate sequential fairness”, which provides a more desirable solution concept than some previously studied approximate fairness notions.

Lower bounds for leader election and collective coin-flipping in the perfect information model

TLDR
It is demonstrated that any n-player coin-flipping protocol that is resilient against corrupt coalitions of linear size must use either at least [1/2 - o(1)]log* n communication rounds or at least[log(2k-1) n]1-o(1) communication bits in the kth round, where log(j) denotes the logarithm iterated j times.

log*-Round Game-Theoretically-Fair Leader Election

TLDR
This paper constructs O(log∗ n) rounds leader election protocols that achieve (1−o(1))-approximate fairness in the presence of (1 − o(1) n-sized coalitions, and obtains game-theoretically fair protocols for committee election which might be of independent interest.

Fair Leader Election for Rational Agents in Asynchronous Rings and Networks

TLDR
This work investigates a game theoretic model where a coalition of processors might collude to bias the outcome of the protocol, and shows that in general the protocol is resilient only to sub-linear size coalitions.

Winning the Caucus Race: Continuous Leader Election via Public Randomness

TLDR
This paper presents Caucus, a large-scale leader election protocol with minimal coordination costs that does not require the computational cost of proof-of-work, and evaluates it in terms of its security, using a new model for blockchain-focused leader election.

Noncryptographic Selection Protocols ( Extended Abstract )

TLDR
New selection protocols in the full information model are presented, and it is shown that every leader election protocol has success probability O(δ1− ), for every > 0.1/δ.

Rationality in the Full-Information Model

TLDR
This work studies rationality in protocol design for the full-information model, a model characterized by computationally unbounded adversaries, no private communication, and no simultaneity within rounds, to design protocols that are faithful and resilient.

Fast asynchronous byzantine agreement and leader election with full information

TLDR
A key technical contribution of the paper is a new approach for emulating Feige's lightest bin protocol, even with adversarial message scheduling, which is Monte Carlo, succeeding with probability 1 - o(1) for Byzantine agreement, and constant probability for leader election.

Randomized algorithms for reliable broadcast

TLDR
This thesis designs randomized algorithms for classical problems in faulttolerant distributed computing in the full-information model and designs two efficient randomized protocols for Byzantine agreement, a classical problem in distributed computing.
...

References

SHOWING 1-10 OF 23 REFERENCES

Fast perfect-information leader-election protocols with linear immunity

AbstractIn this paper we develop a leader election protocolP with the following features:1.The protocol rums in theperfect information model: Every step taken by a player is visible to all

Simple and efficient leader election in the full information model

TLDR
A constructive O(logN) round protocol is exhibited that is resilient against linear size coalitions and an easy, non-constructive probabilistic argument is provided that shows the existence of O( logN)round protocol in which can be made as large as 1 2 for any positive .

Perfect-Information Leader Election with Optimal Resilience

TLDR
It is shown that for every $\epsilon < \half$, there exist leader-election protocols for $n$ processors that tolerate $\eps n$ faults.

Coin-flipping games immune against linear-sized coalitions

  • N. AlonM. Naor
  • Computer Science
    Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science
  • 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

Noncryptographic selection protocols

  • U. Feige
  • Computer Science, Mathematics
    40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)
  • 1999
TLDR
New selection protocols in the full information model are presented, and new negative results are presented when there are (1+/spl delta/)n/2 good players, and it is shown that every leader election protocol has success probability O.

The influence of large coalitions

TLDR
The existence of boolean functions where only sets of at least variables can have influence bounded away from zero is established in the second part of this article.

Fault-tolerant computation in the full information model

TLDR
It is proved for these protocols that for most functions, the influence of any t dishonest players on the outcome of the protocol is the minimum one possible (up to polylogarithmic factors).

An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement

TLDR
This paper exhibits a protocol that, in probabilistic polynomial time and without relying on any external trusted party, reaches Byzantine agreement in an expected constant number of rounds and in the worst natural fault model.

Randomness-optimal oblivious sampling

  • D. Zuckerman
  • Computer Science, Mathematics
    Random Struct. Algorithms
  • 1997
TLDR
This work presents the first efficient oblivious sampler that uses an optimal number of random bits, up to an arbitrary constant factor bigger than 1, and gives applications to constructive leader election and reducing randomness in interactive proofs.

Efficient construction of a small hitting set for combinatorial rectangles in high dimension

We describe a deterministic algorithm which, on input integersd, m and real number ∈∃ (0,1), produces a subset S of [m]d={1,2,3,...,m}d that hits every combinatorial rectangle in [m]d of volume at