89 search results - page 3 / 18 » Fast Byzantine Consensus |
STOC
2005
ACM
15 years 10 months ago
2005
ACM
PODC
2004
ACM
15 years 3 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...
103
Voted
OPODIS
2007
14 years 11 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...
100
Voted
SODA
2008
ACM
14 years 11 months ago
2008
ACM
We resolve two long-standing open problems in distributed computation by describing polylogarithmic protocols for Byzantine agreement and leader election in the asynchronous full ...
87
Voted
DSN
2007
IEEE
15 years 2 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...