A digital signature scheme secure against adaptive chosen-message attacks
SIAM Journal on Computing - Special issue on cryptography
Implementing fault-tolerant services using the state machine approach: a tutorial
ACM Computing Surveys (CSUR)
Fast asynchronous Byzantine agreement with optimal resilience
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
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)
Fault-tolerant broadcasts and related problems
Distributed systems (2nd Ed.)
Practical byzantine fault tolerance and proactive recovery
ACM Transactions on Computer Systems (TOCS)
Quick Atomic Broadcast (Extended Abstract)
WDAG '93 Proceedings of the 7th International Workshop on Distributed Algorithms
Secure and Efficient Asynchronous Broadcast Protocols
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Society and Group Oriented Cryptography: A New Concept
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
The Rampart Toolkit for Building High-Integrity Services
Selected Papers from the International Workshop on Theory and Practice in Distributed Systems
Distributing Trust on the Internet
DSN '01 Proceedings of the 2001 International Conference on Dependable Systems and Networks (formerly: FTCS)
Quantifying the Cost of Providing Intrusion Tolerance in Group Communication Systems
DSN '02 Proceedings of the 2002 International Conference on Dependable Systems and Networks
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
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
Practical threshold signatures
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Optimistic asynchronous atomic broadcast
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Parsimonious asynchronous byzantine-fault-tolerant atomic broadcast
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Robust random number generation for peer-to-peer systems
Theoretical Computer Science
On optimal probabilistic asynchronous Byzantine agreement
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Robust random number generation for peer-to-peer systems
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed 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 |
Atomic broadcast is a communication primitive that allows a group of n parties to deliver a common sequence of payload messages despite the failure of some parties. We address the problem of asynchronous atomic broadcast when up to t n/3 parties may exhibit Byzantine behavior. We provide the first protocol with an amortized expected message complexity of $\mathcal{O}(n)$ per delivered payload. The most efficient previous solutions are the BFT protocol by Castro and Liskov and the KS protocol by Kursawe and Shoup, both of which have message complexity $\mathcal{O}(n^2)$. Like the BFT and KS protocols, our protocol is optimistic and uses inexpensive mechanisms during periods when no faults occur; when network instability or faults are detected, it switches to a more expensive recovery mode. The key idea of our solution is to replace reliable broadcast in the KS protocol by consistent broadcast, which reduces the message complexity from $\mathcal{O}(n^2)$ to $\mathcal{O}(n)$ in the optimistic mode. But since consistent broadcast provides weaker guarantees than reliable broadcast, our recovery mode incorporates novel techniques to ensure that safety and liveness are always satisfied.