Self-stabilizing Byzantine Agreement
Ariel Daliot, Danny Dolev

TL;DR
This paper introduces a self-stabilizing Byzantine agreement algorithm that operates under severe transient faults, requiring only eventual bounded message delays, and includes novel protocols for time assignment and reliable broadcast.
Contribution
It presents the first self-stabilizing Byzantine agreement algorithm that tolerates transient faults with minimal assumptions, using new protocols for time synchronization and reliable broadcast.
Findings
Achieves agreement in the presence of transient faults.
Operates with only eventual bounded message delays.
Develops novel self-stabilizing protocols for time assignment and broadcast.
Abstract
Byzantine agreement algorithms typically assume implicit initial state consistency and synchronization among the correct nodes and then operate in coordinated rounds of information exchange to reach agreement based on the input values. The implicit initial assumptions enable correct nodes to infer about the progression of the algorithm at other nodes from their local state. This paper considers a more severe fault model than permanent Byzantine failures, one in which the system can in addition be subject to severe transient failures that can temporarily throw the system out of its assumption boundaries. When the system eventually returns to behave according to the presumed assumptions it may be in an arbitrary state in which any synchronization among the nodes might be lost, and each node may be at an arbitrary state. We present a self-stabilizing Byzantine agreement algorithm that…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed systems and fault tolerance · Access Control and Trust
