3 search results - page 1 / 1 » Practical Byzantine Fault Tolerance Using Fewer than 3f 1 Ac... |
ISCAPDCS
2004
13 years 6 months ago
2004
Byzantine fault tolerant state machine replication (BFT-SMR) is a foundation for implementations of highly reliable services. Existing algorithms for BFT-SMR require at least 3f +...
OSDI
2000
ACM
13 years 6 months ago
2000
ACM
This paper describes an asynchronous state-machine replication system that tolerates Byzantine faults, which can be caused by malicious attacks or software errors. Our system is t...
SAC
2010
ACM
13 years 11 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...