22 search results - page 2 / 5 » Asynchronous Byzantine consensus with 2f 1 processes |
OPODIS
2007
13 years 6 months ago
2007
This paper tackles the consensus problem in asynchronous systems prone to byzantine failures. One way to circumvent the FLP impossibility result consists in adding synchrony assump...
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...
PODC
1999
ACM
13 years 9 months ago
1999
ACM
ÐIn this paper, we investigate the k-set consensus problem in asynchronous distributed systems. In this problem, each participating process begins the protocol with an input value...
OPODIS
2004
13 years 6 months ago
2004
Consider an asynchronous system where each process begins with an arbitrary real value. Given some fixed > 0, an approximate agreement algorithm must have all non-faulty process...
SPAA
2010
ACM
13 years 10 months ago
2010
ACM
In this work, we address Byzantine agreement in a message passing system with homonyms, i.e. a system with a number l of authenticated identities that is independent of the total ...