Skip to Main content Skip to Navigation
Conference papers

Signature-Free Broadcast-Based Intrusion Tolerance

Achour Mostefaoui 1 Michel Raynal 1 
1 ASAP - As Scalable As Possible: foundations of large scale dynamic distributed systems
Inria Rennes – Bretagne Atlantique , IRISA-D1 - SYSTÈMES LARGE ÉCHELLE
Abstract : Providing application processes with strong agreement guarantees despite failures is a fundamental problem of fault-tolerant distributed computing. Correct processes have not to be ``polluted'' by the erroneous behavior of faulty processes. This paper considers the consensus agreement problem in a setting where some processes can behave arbitrarily (Byzantine behavior). In such a context it is possible that Byzantine processes collude to direct the correct processes to decide on a ``bad'' value (a value proposed only by faulty processes). The paper has several contributions. It presents a family of consensus algorithms in which no bad value is ever decided by correct processes. These processes always decide a value they have proposed or a default value "bottom". These algorithms are called intrusion-free consensus algorithms. To that end, each consensus algorithm is based on an appropriate underlying broadcast algorithm. One of these abstractions, called "validated broadcast" is new and allows the design of a resilience-optimal consensus algorithm (i.e., it copes with up to t
Complete list of metadata
Contributor : Achour Mostefaoui Connect in order to contact the contributor
Submitted on : Wednesday, December 8, 2010 - 3:56:09 PM
Last modification on : Thursday, January 20, 2022 - 4:20:05 PM


  • HAL Id : inria-00544650, version 1


Achour Mostefaoui, Michel Raynal. Signature-Free Broadcast-Based Intrusion Tolerance. 14th International Conference On Principles Of Distributed Systems (OPODIS 2010), Dec 2010, Tozeur, Tunisia. pp.143-159. ⟨inria-00544650⟩



Record views