Implementing fault-tolerant services using the state machine approach: a tutorial
ACM Computing Surveys (CSUR)
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
ACM Transactions on Computer Systems (TOCS)
Practical Byzantine fault tolerance
OSDI '99 Proceedings of the third symposium on Operating systems design and implementation
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
BASE: using abstraction to improve fault tolerance
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Practical byzantine fault tolerance and proactive recovery
ACM Transactions on Computer Systems (TOCS)
ACM SIGACT News
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Optimistic Byzantine Agreement
SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
Separating agreement from execution for byzantine fault tolerant services
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Simple and Efficient Oracle-Based Consensus Protocols for Asynchronous Byzantine Systems
IEEE Transactions on Dependable and Secure Computing
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Tolerating corrupted communication
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Performance study of Byzantine Agreement Protocol with artificial neural network
Information Sciences: an International Journal
Zyzzyva: speculative byzantine fault tolerance
Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
DepSpace: a byzantine fault-tolerant coordination service
Proceedings of the 3rd ACM SIGOPS/EuroSys European Conference on Computer Systems 2008
Zyzzyva: speculative Byzantine fault tolerance
Communications of the ACM - Remembering Jim Gray
Write Markers for Probabilistic Quorum Systems
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Byzantine Consensus with Unknown Participants
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Reducing the costs of large-scale BFT replication
LADIS '08 Proceedings of the 2nd Workshop on Large-Scale Distributed Systems and Middleware
Zyzzyva: Speculative Byzantine fault tolerance
ACM Transactions on Computer Systems (TOCS)
Unifying Byzantine Consensus Algorithms with Weak Interactive Consistency
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Brief announcement: a leader-free byzantine consensus algorithm
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Signature-free broadcast-based intrusion tolerance: never decide a Byzantine value
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
A faster P solution for the Byzantine agreement problem
CMC'10 Proceedings of the 11th international conference on Membrane computing
A leader-free Byzantine consensus algorithm
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
An investigation of the vulnerabilities of scale invariant dynamics in large teams
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
State machine replication with byzantine faults
Replication
Ramos: Concurrent writing and reconfiguration for collaborative systems
Journal of Parallel and Distributed Computing
Probabilistic opaque quorum systems
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Towards Byzantine fault tolerant publish/subscribe: a state machine approach
Proceedings of the 9th Workshop on Hot Topics in Dependable Systems
| Hi-index | 0.00 |
We present the first protocol that reaches asynchronous Byzantine consensus in two communication steps in the common case. We prove that our protocol is optimal in terms of both number of communication steps and number of processes for two--step consensus. The protocol can be used to build a replicated state machine that requires only three communication steps per request in the common case. Further, we show a parameterized version of the protocol that is safe despite f Byzantine failures and, in the common case, guarantees two-step execution despite some number t of failures (t\le f). We show that this parameterized two-step consensus protocol is also optimal in terms of both number of communication steps and number of processes.