We consider the consensus problem in a partially synchronous system with Byzantine faults. In a distributed system of n processes, where each process has an initial value, Byzantine consensus is the problem of agreeing on a common value, even though some of the processes may fail in arbitrary, even malicious, ways. It is shown in [11] that — in a synchronous system — 3t + 1 processes are needed...

Unreliable fault detectors can be used to solve the consensus problem in asynchronous distributed systems that are subject to crash faults. We extend this result to asynchronous distributed systems that are subject to Byzantine faults. We define the class 3S(Byz) of eventually strong Byzantine fault detectors and the class 3W(Byz) of eventually weak Byzantine fault detectors and show that any B...

aughty, sharp-tongued, self-assured, unbearably self-sufficient, stingy, and violent beyond measure , " is how Georges de La Tour was described by his contemporaries. Municipal records confirm that he refused to pay his share to feed the hungry during times of famine. He assaulted an officer, beat a peasant, and made himself obnoxious to everyone by " sending his dogs after hare into the standi...

Throughout the literature on reliable distributed systems there is much coverage of systems which maintain correct operations in the face of fail-stop or non-Byzantine failures. What are less represented are methods for dealing with the harder problem of Byzantine failures. This paper proposes a method for dealing with these sort of failures. Fail-stop or non-Byzantine failures typically are ch...

Byzantine music is a cover term for the liturgical music used in the Orthodox Church within the Byzantine Empire and the Churches regarded as continuing that tradition. This music is monophonic (with drone notes), exclusively vocal, and almost entirely sacred: very little secular music of this kind has been preserved, although we know that court ceremonial music in Byzantium was similar to the ...

Unreliable fault detectors can be defined in terms of completeness and accuracy properties and can be used to solve the consensus problem in asynchronous distributed systems that are subject to crash faults. We extend this result to asynchronous distributed systems that are subject to Byzantine faults. First, we define and categorize Byzantine faults. We then define two new completeness propert...

Self-stabilization is a versatile approach to fault-tolerance since it permits a distributed system to recover from any transient fault that arbitrarily corrupts the contents of all memories in the system. Byzantine tolerance is an attractive feature of distributed systems that permits to cope with arbitrary malicious behaviors. Combining these two properties proved difficult: it is impossible ...