89 search results - page 1 / 18 » Fast Byzantine Consensus |
WDAG
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. We give randomized agreement algorithms with constant expected running time in asynchronous systems subject to process failures, where up to a minority of processes may f...
DSN
2005
IEEE
13 years 10 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...
WDAG
2007
Springer
13 years 10 months ago
2007
Springer
We describe and analyze a 3-state one-way population protocol to compute approximate majority in the model in which pairs of agents are drawn uniformly at random to interact. Given...
ICDCN
2010
Springer
13 years 11 months ago
2010
Springer
The paper considers the consensus problem in a partially synchronous system with Byzantine faults. It turns out that, in the partially synchronous system, all deterministic algorit...
OPODIS
1997
13 years 5 months ago
1997
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 d...