89 search results - page 2 / 18 » Fast Byzantine Consensus |
84
Voted
JPDC
2008
14 years 10 months ago
2008
This paper proposes a variation of the Byzantine generals problem (or Byzantine consensus). Each general has a set of good plans and a set of bad plans. The problem is to make all...
119
Voted
LADC
2011
Springer
14 years 1 months ago
2011
Springer
—We compare in an analytical way two leader-based and decentralized algorithms (that is, algorithms that do not use a leader) for Byzantine consensus with strong validity. We sho...
90
Voted
SAC
2010
ACM
15 years 5 months ago
2010
ACM
Byzantine consensus in asynchronous message-passing systems has been shown to require at least 3f + 1 processes to be solvable in several system models (e.g., with failure detecto...
76
Voted
CORR
2010
Springer
14 years 10 months ago
2010
Springer
In this paper we demonstrate how stateful Byzantine Fault Tolerant services may be hosted on a Chord ring. The strategy presented is fourfold: firstly a replication scheme that di...
88
Voted
OPODIS
2010
14 years 8 months ago
2010
: Provide application processes with strong agreement guarantees despite failures is a fundamental problem of fault-tolerant distributed computing. Correct processes have not to be...