Results 1 - 10 of 324

Small Byzantine Quorum Systems

by Jean-Philippe Martin, Lorenzo Alvisi, Michael Dahlin - DISTRIBUTED COMPUTING , 2001
"... In this paper we present two protocols for asynchronous Byzantine Quorum Systems (BQS) built on top of reliable channels---one for self-verifying data and the other for any data. Our protocols tolerate Byzantine failures with fewer servers than existing solutions by eliminating nonessential work in ..."
Abstract - Cited by 468 (49 self) - Add to MetaCart
In this paper we present two protocols for asynchronous Byzantine Quorum Systems (BQS) built on top of reliable channels---one for self-verifying data and the other for any data. Our protocols tolerate Byzantine failures with fewer servers than existing solutions by eliminating nonessential work

Impossibility of distributed consensus with one faulty process

by Michael J. Fischer, Nancy A Lynch, Michael S. Paterson , 1983
"... The consensus problem involves an asynchronous system of proceses, some of which may be unreliable. The problem is for the rcliablc processes to agree on a bbary value. h this paper, it is shown that every protocol for this problem has the possibility of nontermination, even with only otre faulty p ..."
Abstract - Cited by 1721 (28 self) - Add to MetaCart
The consensus problem involves an asynchronous system of proceses, some of which may be unreliable. The problem is for the rcliablc processes to agree on a bbary value. h this paper, it is shown that every protocol for this problem has the possibility of nontermination, even with only otre faulty

Consensus in the presence of partial synchrony

by Cynthia Dwork, Nancy Lynch, Larry Stockmeyer - JOURNAL OF THE ACM , 1988
"... The concept of partial synchrony in a distributed system is introduced. Partial synchrony lies between the cases of a synchronous system and an asynchronous system. In a synchronous system, there is a known fixed upper bound A on the time required for a message to be sent from one processor to ano ..."
Abstract - Cited by 513 (18 self) - Add to MetaCart
to another and a known fixed upper bound (I, on the relative speeds of different processors. In an asynchronous system no fixed upper bounds A and (I, exist. In one version of partial synchrony, fixed bounds A and (I, exist, but they are not known a priori. The problem is to design protocols that work

Asynchronous Consensus and Broadcast Protocols

by Gabriel Bracha, Sam Toueg - Journal of the ACM , 1985
"... Abstract. A consensus protocol enables a system of n asynchronous processes, some of which are faulty, to reach agreement. There are two kinds of faulty processes: fail-stop processes that can only die and malicious processes that can also send false messages. The class of asynchronous systems with ..."
Abstract - Cited by 166 (4 self) - Add to MetaCart
Abstract. A consensus protocol enables a system of n asynchronous processes, some of which are faulty, to reach agreement. There are two kinds of faulty processes: fail-stop processes that can only die and malicious processes that can also send false messages. The class of asynchronous systems

Consensus in Byzantine asynchronous systems

by R. Baldoni, J.-M. Helary, M. Raynal, L. Tanguy - JOURNAL OF DISCRETE ALGORITHMS , 2000
"... This paper presents a consensus protocol resilient to Byzantine failures. It uses signed and certified messages and is based on two underlying failure detection modules. The first is an unreliable failure detector module of the class ✸S(bz). The second is a reliable arbitrary behavior detection modu ..."
Abstract - Cited by 19 (0 self) - Add to MetaCart
This paper presents a consensus protocol resilient to Byzantine failures. It uses signed and certified messages and is based on two underlying failure detection modules. The first is an unreliable failure detector module of the class ✸S(bz). The second is a reliable arbitrary behavior detection

Practical Byzantine fault tolerance and proactive recovery

by Miguel Castro, Barbara Liskov - ACM Transactions on Computer Systems , 2002
"... Our growing reliance on online services accessible on the Internet demands highly available systems that provide correct service without interruptions. Software bugs, operator mistakes, and malicious attacks are a major cause of service interruptions and they can cause arbitrary behavior, that is, B ..."
Abstract - Cited by 410 (7 self) - Add to MetaCart
, Byzantine faults. This article describes a new replication algorithm, BFT, that can be used to build highly available systems that tolerate Byzantine faults. BFT can be used in practice to implement real services: it performs well, it is safe in asynchronous environments such as the Internet

Fast Byzantine consensus

by Jean-Philippe Martin, Lorenzo Alvisi - IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING , 2005
"... Abstract — We present the first protocol that reaches asynchronous Byzantine consensus in two communication steps in the common case. We prove that our protocol is optimal in terms of both number of communication steps, and number of processes for two-step consensus. The protocol can be used to buil ..."
Abstract - Cited by 93 (6 self) - Add to MetaCart
Abstract — We present the first protocol that reaches asynchronous Byzantine consensus in two communication steps in the common case. We prove that our protocol is optimal in terms of both number of communication steps, and number of processes for two-step consensus. The protocol can be used

1Byzantine Fault-Tolerant Consensus in Wireless Ad hoc Networks

by Henrique Moniz, Nuno F. Neves, Miguel Correia
"... Abstract—Wireless ad hoc networks, due to their inherent unreliability, pose significant challenges to the task of achieving tight coordination amongst nodes. The failure of some nodes and momentary breakdown of communications, either of accidental or malicious nature, should not result in the failu ..."
Abstract - Add to MetaCart
in the failure of the entire system. This paper presents an asynchronous Byzantine consensus protocol- called Turquois- specifically designed for resource-constrained wireless ad hoc networks. The key to its efficiency is the fact that it tolerates dynamic message omissions, which allows an efficient utilization

Automatic Verification and Discovery of Byzantine Consensus Protocols

by unknown authors
"... Model-checking of asynchronous distributed protocols is challenging because of the large size of the state and solution spaces. This paper tackles this problem in the context of low-latency Byzantine Consensus protocols. It reduces the state space by focusing on the latency-determining first round o ..."
Abstract - Add to MetaCart
Model-checking of asynchronous distributed protocols is challenging because of the large size of the state and solution spaces. This paper tackles this problem in the context of low-latency Byzantine Consensus protocols. It reduces the state space by focusing on the latency-determining first round

On the Minimal Synchronism Needed for Distributed Consensus

by Danny Dolev, Cynthia Dwork, Larry Stockmeyer - Journal of the ACM , 1987
"... Abstract. Reaching agreement is a primitive of distributed computing. Whereas this poses no problem in an ideal, failure-free environment, it imposes certain constraints on the capabilities of an actual system: A system is viable only if it permits the existence of consensus protocols tolerant to so ..."
Abstract - Cited by 264 (11 self) - Add to MetaCart
Abstract. Reaching agreement is a primitive of distributed computing. Whereas this poses no problem in an ideal, failure-free environment, it imposes certain constraints on the capabilities of an actual system: A system is viable only if it permits the existence of consensus protocols tolerant
Results 1 - 10 of 324