7 search results - page 1 / 2 » Synchronous Consensus with Mortal Byzantines |
DSN
2007
IEEE
13 years 6 months ago
2007
IEEE
ICDCN
2010
Springer
13 years 12 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...
PODC
2012
ACM
11 years 7 months ago
2012
ACM
This paper proves a necessary and sufficient condition for the existence of iterative algorithms that achieve approximate Byzantine consensus in arbitrary directed graphs, where e...
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...
SPAA
2010
ACM
13 years 9 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 ...