Self-stabilizing Byzantine- and Intrusion-tolerant Consensus

10/16/2021
by   Romaric Duvignau, et al.
0

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 intrusion-tolerant 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 self-stabilization, 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/30/2022

Self-stabilizing Byzantine-tolerant Broadcast

We study a well-known communication abstraction called Byzantine Reliabl...
research
07/27/2023

Self-stabilizing Byzantine-tolerant Recycling

Numerous distributed applications, such as cloud computing and distribut...
research
02/25/2021

Revisiting Optimal Resilience of Fast Byzantine Consensus

It is a common belief that Byzantine fault-tolerant solutions for consen...
research
03/26/2021

Loosely-self-stabilizing Byzantine-tolerant Binary Consensus for Signature-free Message-passing Systems

At PODC 2014, A. Mostéfaoui, H. Moumen, and M. Raynal presented a new an...
research
10/12/2020

Self-Stabilizing Indulgent Zero-degrading Binary Consensus

Guerraoui proposed an indulgent solution for the binary consensus proble...
research
03/22/2023

Consensus on Unknown Torus with Dense Byzantine Faults

We present a solution to consensus on a torus with Byzantine faults. Any...
research
04/07/2022

Reaching Consensus in the Byzantine Empire: A Comprehensive Review of BFT Consensus Algorithms

Byzantine fault-tolerant (BFT) consensus algorithms are at the core of p...

Please sign up or login with your details

Forgot password? Click here to reset