Practical Byzantine fault tolerance
OSDI '99 Proceedings of the third symposium on Operating systems design and implementation
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed computing: fundamentals, simulations and advanced topics
Distributed computing: fundamentals, simulations and advanced topics
Diffusion without false rumors: on propagating updates in a Byzantine environment
Theoretical Computer Science
Tolerance to Unbounded Byzantine Faults
SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
Broadcast in radio networks tolerating byzantine adversarial behavior
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Distributed Computing
On reliable broadcast in a radio network
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Efficient Byzantine Broadcast in Wireless Ad-Hoc Networks
DSN '05 Proceedings of the 2005 International Conference on Dependable Systems and Networks
Discovering Network Topology in the Presence of Byzantine Faults
IEEE Transactions on Parallel and Distributed Systems
Broadcasting with locally bounded Byzantine faults
Information Processing Letters
Bounding the impact of unbounded attacks in stabilization
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
The impact of topology on Byzantine containment in stabilization
DISC'10 Proceedings of the 24th international conference on Distributed computing
On byzantine containment properties of the min + 1 protocol
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Maximum metric spanning tree made Byzantine tolerant
DISC'11 Proceedings of the 25th international conference on Distributed computing
A self-stabilizing link-coloring protocol resilient to byzantine faults in tree networks
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
Limiting Byzantine Influence in Multihop Asynchronous Networks
ICDCS '12 Proceedings of the 2012 IEEE 32nd International Conference on Distributed Computing Systems
Bounding the Impact of Unbounded Attacks in Stabilization
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
We consider the problem of reliably broadcasting information in a multihop asynchronous network that is subject to Byzantine failures. Most existing approaches give conditions for perfect reliable broadcast (all correct nodes deliver the authentic message and nothing else), but they require a highly connected network. An approach giving only probabilistic guarantees (correct nodes deliver the authentic message with high probability) was recently proposed for loosely connected networks, such as grids and tori. Yet, the proposed solution requires a specific initialization (that includes global knowledge) of each node, which may be difficult or impossible to guarantee in self-organizing networks --- for instance, a wireless sensor network, especially if they are prone to Byzantine failures. In this paper, we propose a new protocol offering guarantees for loosely connected networks that does not require such global knowledge dependent initialization. In more details, we give a methodology to determine whether a set of nodes will always deliver the authentic message, in any execution. Then, we give conditions for perfect reliable broadcast in a torus network. Finally, we provide experimental evaluation for our solution, and determine the number of randomly distributed Byzantine failures than can be tolerated, for a given correct broadcast probability.