Multi-hop Byzantine Reliable Broadcast Made Practical

We revisit Byzantine-tolerant reliable broadcast algorithms in multi-hop networks. To tolerate up to f Byzantine nodes, previous solutions require an exponential number of messages to be sent over the network. We propose optimizations that preserve the safety and liveness properties of the original algorithms, while highly decreasing their observed message complexity when simulated on two families of random graphs.

[1]  Danny Dolev,et al.  Unanimity in an unknown and unreliable environment , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[2]  D.Frank Hsu,et al.  On Container Width and Length in Graphs, Groups,and Networks--Dedicated to Professor Paul Erdös on the occasion of his 80th birthday-- , 1994 .

[3]  D. Frank Hsu,et al.  On the k-diameter of k-regular k-connected graphs , 1994, Discret. Math..

[4]  John R. Douceur,et al.  The Sybil Attack , 2002, IPTPS.

[5]  Prasant Mohapatra,et al.  Non-cryptographic authentication and identification in wireless networks [Security and Privacy in Emerging Wireless Networks] , 2010, IEEE Wireless Communications.

[6]  L. Lovász,et al.  Mengerian theorems for paths of bounded length , 1978 .

[7]  Sébastien Tixeuil,et al.  Byzantine broadcast with fixed disjoint paths , 2014, J. Parallel Distributed Comput..

[8]  Miguel Oom Temudo de Castro,et al.  Practical Byzantine fault tolerance , 1999, OSDI '99.

[9]  Takeaki Uno,et al.  Efficient algorithms for dualizing large-scale hypergraphs , 2011, Discret. Appl. Math..

[10]  Sébastien Tixeuil,et al.  Containing Byzantine Failures with Control Zones , 2015, IEEE Transactions on Parallel and Distributed Systems.

[11]  Junming Xu.  Topological Structure and Analysis of Interconnection Networks , 2002, Network Theory and Applications.

[12]  Nicholas C. Wormald,et al.  Generating Random Regular Graphs Quickly , 1999, Combinatorics, Probability and Computing.

[13]  Amit Kumar,et al.  Connectivity and inference problems for temporal networks , 2000, Symposium on the Theory of Computing.

[14]  Alan J. Demers,et al.  Logarithmic Harary graphs , 2001, Proceedings 21st International Conference on Distributed Computing Systems Workshops.

[15]  Sébastien Tixeuil,et al.  Discovering Network Topology in the Presence of Byzantine Faults , 2006, IEEE Transactions on Parallel and Distributed Systems.

[16]  Andrzej Pelc,et al.  Broadcasting with locally bounded Byzantine faults , 2005, Inf. Process. Lett..

[17]  Paola Vera-Licona,et al.  The minimal hitting set generation problem: algorithms and computation , 2016, SIAM J. Discret. Math..

[18]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[19]  Roberto Baldoni,et al.  Investigating the Existence and the Regularity of Logarithmic Harary Graphs , 2008, 2008 Symposium on Reliable Distributed Systems.

[20]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[21]  Roy Friedman,et al.  Efficient Byzantine broadcast in wireless ad-hoc networks , 2005, 2005 International Conference on Dependable Systems and Networks (DSN'05).

[22]  Sébastien Tixeuil,et al.  Tolerating Random Byzantine Failures in an Unbounded Network , 2016, Parallel Process. Lett..

[23]  Aris Pagourtzis,et al.  Reliable Broadcast with Respect to Topology Knowledge , 2014, DISC.

[24]  Xavier Défago,et al.  Communicating Reliably in Multihop Dynamic Networks Despite Byzantine Failures , 2015, 2015 IEEE 34th Symposium on Reliable Distributed Systems (SRDS).