Efficient fault tolerant consensus using preemptive token
ACAI '11 Proceedings of the International Conference on Advances in Computing and Artificial Intelligence
An agreement protocol to handle byzantine failures in authenticated hierarchical configuration
ADCONS'11 Proceedings of the 2011 international conference on Advanced Computing, Networking and Security
Hash-based Byzantine fault tolerant agreement with enhanced view consistency
International Journal of Communication Networks and Distributed Systems
Hi-index | 0.00 |
In this paper, we present a Byzantine fault tolerant distributed commit protocol for transactions running over untrusted networks. The traditional two-phase commit protocol is enhanced by replicating the coordinator and by running a Byzantine agreement algorithm among the coordinator replicas. Our protocol can tolerate Byzantine faults at the coordinator replicas and a subset of malicious faults at the participants. A decision certificate, which includes a set of registration records and a set of votes from participants, is used to facilitate the coordinator replicas to reach a Byzantine agreement on the outcome of each transaction. The certificate also limits the ways a faulty replica can use towards non-atomic termination of transactions, or semantically incorrect transaction outcomes.