Self-stabilizing Byzantine Consensus for Blockchain

Binun, Alexander; Hadad, Tal

doi:10.1007/978-3-030-20951-3_10

Cited by 6 publications

(4 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Mostéfaoui, Moumen, and Raynal [32] (MMR in short) presented BFT algorithms for solving Binary consensus using common coins, of which [26,27] recently introduced a self-stabilizing variation that satisfies the safety requirements, i.e., agreement and validity, with an exponentially high probability that depends only on a predefined constant, which safeguards safety. The related work also includes SSBFT state-machine replication by Binun et al [7,8] for synchronous systems and Dolev et al [17] for practically-self-stabilizing partially-synchronous systems. Note that both Binun et al and Dolev et al study another problem for another kind of system setting.…”

Section: Related Workmentioning

confidence: 99%

Self-stabilizing Byzantine Fault-Tolerant Repeated Reliable Broadcast

Duvignau

Raynal

Schiller

2022

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Consensus, abstracting a myriad of problems in which processes have to agree on a single value, is one of the most celebrated problems of fault-tolerant distributed computing. Consensus applications include fundamental services for the environments of the Cloud and Blockchain, and in such challenging environments, malicious behaviors are often modeled as adversarial Byzantine faults.At OPODIS 2010, Mostéfaoui and Raynal (in short MR) presented a Byzantinetolerant solution to consensus in which the decided value cannot be a value proposed only by Byzantine processes. MR has optimal resilience coping with up to t < n/3 Byzantine nodes over n processes. MR provides this multivalued consensus object (which accepts proposals taken from a finite set of values) assuming the availability of a single Binary consensus object (which accepts proposals taken from the set {0, 1}).This work, which focuses on multivalued consensus, aims at the design of an even more robust solution than MR. Our proposal expands MR's fault-model with self-stabilization, a vigorous notion of fault-tolerance. In addition to tolerating Byzantine, self-stabilizing systems can automatically recover after the occurrence of arbitrary transient-faults. These faults represent any violation of the assumptions according to which the system was designed to operate (provided that the algorithm code remains intact).To the best of our knowledge, we propose the first self-stabilizing solution for intrusion-tolerant multivalued consensus for asynchronous message-passing systems prone to Byzantine failures. Our solution has a O(t) stabilization time from arbitrary transient faults.

show abstract

Section: Related Workmentioning

confidence: 99%

Self-stabilizing Byzantine Fault-Tolerant Repeated Reliable Broadcast

Duvignau

Raynal

Schiller

2022

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…In the broader context of self-stabilizing Byzantine-tolerant solutions for message-passing systems, we find solutions for topology discovery [18], storage [11,10,9,8,7], clock synchronization [20,27,25], approximate agreement [12], asynchronous unison [23] to name a few. Also, Byzantine-tolerant state-machine replication by Binun et al [4,5] for synchronous systems and Dolev et al [16] for practically-self-stabilizing partially-synchronous systems. This work also considers a self-stabilizing Byzantine-tolerant mechanism for recycling singleinstance BRB objects.…”

Section: Related Workmentioning

confidence: 99%

Self-stabilizing Byzantine-tolerant Broadcast

Duvignau¹,

Raynal²,

Schiller³

2022

Preprint

View full text Add to dashboard Cite

We study a well-known communication abstraction called Byzantine Reliable Broadcast (BRB). This abstraction is central in the design and implementation of fault-tolerant distributed systems, as many fault-tolerant distributed applications require communication with provable guarantees on message deliveries. Our study focuses on fault-tolerant implementations for message-passing systems that are prone to process-failures, such as crashes and malicious behavior.At PODC 1983, Bracha and Toueg, in short, BT, solved the BRB problem. BT has optimal resilience since it can deal with t < n/3 Byzantine processes, where n is the number of processes. The present work aims at the design of an even more robust solution than BT by expanding its fault-model with self-stabilization, a vigorous notion of fault-tolerance. In addition to tolerating Byzantine and communication failures, self-stabilizing systems can recover after the occurrence of arbitrary transient-faults. These faults represent any violation of the assumptions according to which the system was designed to operate (provided that the algorithm code remains intact).We propose, to the best of our knowledge, the first self-stabilizing Byzantinetolerant BRB solution for signature-free message-passing systems. Our contribution includes a self-stabilizing variation on a BT that solves a single-round BRB for asynchronous systems. We also consider the problem of recycling instances of singleround BRB. Our self-stabilizing Byzantine-tolerant recycling for time-free systems facilitates the concurrent handling of a predefined number of BRB invocations. Our proposal can serve as the basis for self-stabilizing Byzantine-tolerant consensus.

show abstract

“…In the broader context of self-stabilizing Byzantine-tolerant solutions for message-passing systems, we find solutions for topology discovery [22], storage [11,10,9,8,7], clock synchronization [24,31,29], approximate agreement [12], asynchronous unison [25] to name a few. Also, Byzantine-tolerant state-machine replication by Binun et al [4,5] for synchronous systems and Dolev et al [20] for practically-self-stabilizing partially-synchronous systems.…”

Section: Related Workmentioning

confidence: 99%

Self-stabilizing Byzantine- and Intrusion-tolerant Consensus

Duvignau¹,

Raynal²,

Schiller³

2021

Preprint

View full text Add to dashboard Cite

One of the most celebrated problems of fault-tolerant distributed computing is the consensus problem. It was shown to abstract a myriad of problems in which processes have to agree on a single value. Consensus applications include fundamental services for the environments of the Cloud or Blockchain. In such challenging environments, malicious behavior is often modeled as adversarial Byzantine faults. At OPODIS 2010, Mostéfaoui and Raynal, in short, MR, presented a Byzantine-and intrusiontolerant solution to consensus in which the decided value cannot be a value proposed only by Byzantine processes. In addition to this validity property, MR has optimal resilience since it can deal with up to t < n/3 Byzantine processes, where n is the number of processes. We note that MR provides this multivalued consensus object (which accepts proposals taken from a set with a finite number of values) assuming the availability of a single Binary consensus object (which accepts proposals taken from the set {0, 1}).This work, which focuses on multivalued consensus, aims at the design of an even more robust solution than MR. Our proposal expands MR's fault-model with selfstabilization, a vigorous notion of fault-tolerance. In addition to tolerating Byzantine and communication failures, self-stabilizing systems can automatically recover after the occurrence of arbitrary transient-faults. These faults represent any violation of the assumptions according to which the system was designed to operate (provided that the algorithm code remains intact). We propose, to the best of our knowledge, the first self-stabilizing solution for intrusion-tolerant multivalued consensus for asynchronous message-passing systems prone to Byzantine failures.

show abstract

Self-stabilizing Byzantine Consensus for Blockchain

Cited by 6 publications

References 10 publications

Self-stabilizing Byzantine Fault-Tolerant Repeated Reliable Broadcast

Self-stabilizing Byzantine Fault-Tolerant Repeated Reliable Broadcast

Self-stabilizing Byzantine-tolerant Broadcast

Self-stabilizing Byzantine- and Intrusion-tolerant Consensus

Contact Info

Product

Resources

About