Synchronous Consensus with Mortal Byzantines

Widder, Josef; Gridling, Gunther; Weiss, Bettina; Blanquart, Jean-Paul

doi:10.1109/dsn.2007.91

Cited by 12 publications

(10 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A stronger model, where the system is synchronous and Byzantine processes eventually crash (but do not recover) is considered in [3] to solve consensus.…”

Section: Related Workmentioning

confidence: 99%

“…In the case of arbitrary value faults, however, a transient fault can leave a process with a corrupted state, and thus the assumption of permanent faults seems to be justified for these kind of faults. However, its very unlikely that Byzantine faults live forever: often processes with a corrupted state crash [3], can be detected to be erroneous [4,5], or are subject to proactive recovery [6].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Consensus when all processes may be Byzantine for some time

Biely

Hutle

2011

Theoretical Computer Science

View full text Add to dashboard Cite

a b s t r a c tAmong all classes of faults, Byzantine faults form the most general modeling of value faults. Traditionally, in the Byzantine fault model, faults are statically attributed to a set of up to t processes. This, however, implies that in this model a process at which a value fault occurs is forever ''stigmatized'' as being Byzantine, an assumption that might not be acceptable for long-lived systems, where processes need to be reintegrated after a fault.We thus consider a model where Byzantine processes can recover in a predefined recovery state, and show that consensus can be solved in such a model. Our model admits executions where over time every process is faulty as long as there are always enough correct processes.

show abstract

“…A stronger model, where the system is synchronous and Byzantine processes eventually crash (but do not recover) is considered in [3] to solve consensus.…”

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Consensus when all processes may be Byzantine for some time

Biely

Hutle

2011

Theoretical Computer Science

View full text Add to dashboard Cite

show abstract

“…Another algorithm which requires a fixed number of rounds of message exchange ((n-1)/3+1) is called the Immediate Consensus Algorithm (ICA). The Ensure Algorithm developed by Krings et al [16] and the SMBTC (Synchronous Mortal Byzantine Tolerant Consensus) algorithm by Widder et al [22] all belong to ECA. For SMC protocols, some researchers attempted to reduce the number of rounds of message exchange by employing the digital signature technology or improving the algorithm.…”

Section: An Overviewmentioning

confidence: 99%

Simple and Efficient Signature-based Consensus Protocol in the Asynchronous Distributed System

Cheng

Tsai

Liao

2012

ITC

View full text Add to dashboard Cite

The consensus problem in distributed systems is mainly solved by message exchange. Most of previous consensus algorithms rely on exchange of oral messages to achieve consensus among processors. As oral messages are susceptible to influences from malicious attackers, this type of consensus protocols usually requires a large number of rounds of message exchange, and the complexity of message exchange is also excessively high. In light of this drawback of oral message-based consensus algorithms, some scholars proposed signed message-based consensus algorithm to reduce the number of rounds of message exchange required. However, some signed message-based consensus algorithms still have certain drawbacks which make them ineffective in some conditions. To address this issue, we propose a new signed message-based consensus algorithm in this paper. We integrate the concept of grouping into the proposed algorithm and find the best number of groups through mathematical analysis to further reduce the rounds of message exchange required. In other words, the proposed algorithm makes use of digital signature and the concept of grouping to solve the consensus problem. This algorithm can not only increase the fault-tolerance of distributed systems but also significantly reduce the rounds of message exchange required to achieve consensus.

show abstract

“…Bazzi and Herlihy [12] have generalized our results [46] in the synchronous case for hybrid failure models, namely for systems where processes can exhibit both mortal Byzantine and classic Byzantine faults. One could consider that this models systems where only some of the Byzantine failures are detected even if they are perpetually faulty and not just for a few steps as in our models of Sect.…”

Section: Mortal Byzantine Faultsmentioning

confidence: 99%

“…As a correct processes halts (line 46) only after it has decided (line 45) no correct process ever halts.…”

Section: Theorem 10 (Decision) Eventually Every Correct Process Decimentioning

confidence: 99%

Consensus in the presence of mortal Byzantine faulty processes

et al. 2011

Self Cite

View full text Add to dashboard Cite

We consider the problem of reaching agreement in distributed systems in which some processes may deviate from their prescribed behavior before they eventually crash. We call this failure model "mortal Byzantine". After discussing some application examples where this model is justified, we provide matching upper and lower bounds on the number of faulty processes, and on the required number of rounds in synchronous systems. We then continue our study by varying different system parameters. On the one hand, we consider the failure model under weaker timing assumptions, namely for partially synchronous systems and asynchronous systems with unreliable failure detectors. On the other hand, we vary the failure model in that we limit the occurrences of faulty steps that actually lead to a crash in synchronous systems.

show abstract

Synchronous Consensus with Mortal Byzantines

Cited by 12 publications

References 24 publications

Consensus when all processes may be Byzantine for some time

Consensus when all processes may be Byzantine for some time

Simple and Efficient Signature-based Consensus Protocol in the Asynchronous Distributed System

Consensus in the presence of mortal Byzantine faulty processes

Contact Info

Product

Resources

About