Fast asynchronous Byzantine agreement with optimal resilience
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Secure agreement protocols: reliable and atomic group multicast in rampart
CCS '94 Proceedings of the 2nd ACM Conference on Computer and communications security
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Practical Byzantine fault tolerance
OSDI '99 Proceedings of the third symposium on Operating systems design and implementation
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Secure and Efficient Asynchronous Broadcast Protocols
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
The SecureRing Protocols for Securing Group Communication
HICSS '98 Proceedings of the Thirty-First Annual Hawaii International Conference on System Sciences - Volume 3
An asynchronous [(n - 1)/3]-resilient consensus protocol
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Abstractions for Devising Byzantine-Resilient State Machine Replication
SRDS '00 Proceedings of the 19th IEEE Symposium on Reliable Distributed Systems
Authenticated Byzantine Fault Tolerance Without Public-Key Cryptography
Authenticated Byzantine Fault Tolerance Without Public-Key Cryptography
Proceedings of the 5th European conference on Computer systems
Parsimonious asynchronous byzantine-fault-tolerant atomic broadcast
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
State machine replication with byzantine faults
Replication
| Hi-index | 0.00 |
This paper presents a new protocol for atomic broadcast in an asynchronous network with a maximal number of Byzantine failures. It guarantees both safety and liveness without making any timing assumptions. Under normal circumstances, the protocol runs in an extremely efficient “optimistic mode,” while in rare circumstances the protocol may briefly switch to a less efficient “pessimistic mode.”