International Symposium on Distributed Computing

Distributed Computing pp 276-291

Fast Byzantine Leader Election in Dynamic Networks

  • John Augustine
  • Gopal Pandurangan
  • Peter Robinson
Conference paper

DOI: 10.1007/978-3-662-48653-5_19

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9363)
Cite this paper as:
Augustine J., Pandurangan G., Robinson P. (2015) Fast Byzantine Leader Election in Dynamic Networks. In: Moses Y. (eds) Distributed Computing. Lecture Notes in Computer Science, vol 9363. Springer, Berlin, Heidelberg


We study the fundamental Byzantine leader election problem in dynamic networks where the topology can change from round to round and nodes can also experience heavy churn (i.e., nodes can join and leave the network continuously over time). We assume the full information model where the Byzantine nodes have complete knowledge about the entire state of the network at every round (including random choices made by all the nodes), have unbounded computational power and can deviate arbitrarily from the protocol. The churn is controlled by an adversary that has complete knowledge and control over which nodes join and leave and at what times and also may rewire the topology in every round and has unlimited computational power, but is oblivious to the random choices made by the algorithm.

Our main contribution is an \(O(\log ^3 n)\) round algorithm that achieves Byzantine leader election under the presence of up to \(O({n}^{1/2 - \varepsilon })\) Byzantine nodes (for a small constant \(\epsilon > 0\)) and a churn of up to \(O(\sqrt{n}/{\text {polylog}}(n))\) nodes per round (where n is the stable network size). The algorithm elects a leader with probability at least \(1-n^{-\varOmega (1)}\) and guarantees that it is an honest node with probability at least \(1-n^{-\varOmega (1)}\); assuming the algorithm succeeds, the leader’s identity will be known to a \(1-o(1)\) fraction of the honest nodes. Our algorithm is fully-distributed, lightweight, and is simple to implement. It is also scalable, as it runs in polylogarithmic (in n) time and requires nodes to send and receive messages of only polylogarithmic size per round. To the best of our knowledge, our algorithm is the first scalable solution for Byzantine leader election in a dynamic network with a high rate of churn; our protocol can also be used to solve Byzantine agreement in a straightforward way. We also show how to implement an (almost-everywhere) public coin with constant bias in a dynamic network with Byzantine nodes and provide a mechanism for enabling honest nodes to store information reliably in the network, which might be of independent interest.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2015

Authors and Affiliations

  • John Augustine
    • 1
  • Gopal Pandurangan
    • 2
  • Peter Robinson
    • 3
  1. 1.Indian Institute of Technology MadrasChennaiIndia
  2. 2.Department of Computer ScienceUniversity of HoustonHoustonUSA
  3. 3.Queen’s University BelfastBelfastUK

Personalised recommendations