83 search results - page 3 / 17 » Consensus in byzantine asynchronous systems |
ISPDC
2006
IEEE
13 years 11 months ago
2006
IEEE
Optimistically Terminating Consensus (OTC) is a variant of Consensus that decides if all correct processes propose the same value. It is surprisingly easy to implement: processes ...
DSN
2005
IEEE
13 years 11 months ago
2005
IEEE
— 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 bo...
DSN
2007
IEEE
13 years 9 months ago
2007
IEEE
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 l...
DSN
2002
IEEE
13 years 10 months ago
2002
IEEE
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. ...
PODC
2004
ACM
13 years 11 months ago
2004
ACM
We present Byzantine Disk Paxos, an asynchronous shared-memory consensus algorithm that uses a collection of n > 3t disks, t of which may fail by becoming non-responsive or arb...