Byzantine Consensus in Directed Graphs

Consider a synchronous point-to-point network of n nodes connected by directed links, wherein each node has a binary input. This paper proves a tight necessary and sucient condition on the underlying communication topology for achieving Byzantine consensus among these nodes in the presence of up to f Byzantine faults. We derive a necessary condition, and then we provide a constructive proof of suciency by presenting a Byzantine consensus algorithm for directed graphs that satisfy the necessary condition.

[1]  Nitin H. Vaidya,et al.  Iterative Byzantine Vector Consensus in Incomplete Graphs , 2013, ICDCN.

[2]  Shreyas Sundaram,et al.  Resilient Asymptotic Consensus in Robust Networks , 2013, IEEE Journal on Selected Areas in Communications.

[3]  Lewis Tseng,et al.  Iterative Approximate Byzantine Consensus under a Generalized Fault Model , 2012, ICDCN.

[4]  Shreyas Sundaram,et al.  Robustness of complex networks with implications for consensus and contagion , 2012, 2012 IEEE 51st IEEE Conference on Decision and Control (CDC).

[5]  Shreyas Sundaram,et al.  Consensus of multi-agent networks in the presence of adversaries using only local information , 2012, HiCoNS '12.

[6]  Lewis Tseng,et al.  Iterative approximate byzantine consensus in arbitrary directed graphs , 2012, PODC '12.

[7]  K. Srinathan,et al.  Byzantine Agreement Using Partial Authentication , 2011, DISC.

[8]  Alysson Neves Bessani,et al.  Byzantine Consensus with Unknown Participants , 2008, OPODIS.

[9]  Idit Keidar,et al.  Impossibility Results and Lower Bounds for Consensus under Link Failures , 2008, SIAM J. Comput..

[10]  K. Srinathan,et al.  Unconditionally reliable message transmission in directed networks , 2008, SODA '08.

[11]  Yongge Wang,et al.  Perfectly Secure Message Transmission Revisited , 2002, IEEE Transactions on Information Theory.

[12]  D. West Introduction to Graph Theory , 1995 .

[13]  P. Gács,et al.  Algorithms , 1992 .

[14]  Moti Yung,et al.  Perfectly secure message transmission , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[15]  Nancy A. Lynch,et al.  Easy impossibility proofs for distributed consensus problems , 1985, PODC '85.

[16]  J. T. Sims,et al.  The Byzantine Generals Problem , 1982, TOPL.

[17]  Danny Dolev,et al.  The Byzantine Generals Strike Again , 1981, J. Algorithms.

[18]  Yvo Desmedt,et al.  Perfectly Secure Message Transmission , 2011, Encyclopedia of Cryptography and Security.

[19]  Hagit Attiya,et al.  Distributed Computing: Fundamentals, Simulations and Advanced Topics , 1998 .

[20]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.