Self-stabilization of Byzantine Protocols

Awareness of the need for robustness in distributed systems increases as distributed systems become integral parts of day-to-day systems. Self-stabilizing while tolerating ongoing Byzantine faults are wishful properties of a distributed system. Many distributed tasks (e.g. clock synchronization) possess ecient non-stabilizing solutions tolerating Byzantine faults or conversely non-Byzantine but self-stabilizing solutions. In contrast, designing algorithms that self-stabilize while at the same time tolerating an eventual fraction of permanent Byzantine failures present a special challenge due to the ambition of malicious nodes to hamper stabilization if the systems tries to recover from a corrupted state. This diculty might be indicated by the remarkably few algorithms that are resilient to both fault models. We present the rst scheme that takes a Byzantine distributed algorithm and produces its self-stabilizing Byzantine counterpart, while having a relatively low overhead of O(f )...

• Type: Conference
• Year: 2005
• Where: SSS
• Authors: Ariel Daliot, Danny Dolev
• Keywords: Byzantine, Byzantine Faults, Distributed System, SSS 2005