- Author:
- Sam Toueg
A randomized protocol for reaching Byzantine Agreement in asynchronous systems with $n$ processes was recently proposed in [Rabi83]. This protocol tolerates up to $\lfloor (n-1)/10 \rfloor$ faulty processes, and agreement is reached within an expected number of phases that is a small constant independent of $n$ and the number of faulty processes $t$. In this paper, using the same computation model as in [Rabi83], it is shown that no Byzantine Agreement protocol can overcome more than $\lfloor (n-1)/3 \rfloor$ faulty processes in an asynchronous system, and we describe a protocol that achieves this upper bound. Agreement is also reached within an expected number of phases that is a small constant independent of $n$ and $t$, but the communication complexity is higher than in [Rabi83}.
Recommendations
Randomized Byzantine Agreements
PODC '84: Proceedings of the third annual ACM symposium on Principles of distributed computingRandomized algorithms for reaching Byzantine Agreement were recently proposed in [Rabi83]. With these algorithms, agreement is reached within an expected number of phases that is a small constant independent of the number of processes n and the number ...
Simple and efficient asynchronous byzantine agreement with optimal resilience
PODC '09: Proceedings of the 28th ACM symposium on Principles of distributed computingConsider a completely asynchronous network consisting of n parties where every two parties are connected by a private channel. An adversary At with unbounded computing power actively controls at most t = ([n/3] − 1) out of n parties in Byzantine ...
Almost-Surely Terminating Asynchronous Byzantine Agreement Revisited
PODC '18: Proceedings of the 2018 ACM Symposium on Principles of Distributed ComputingThe problem of Byzantine Agreement (BA) is of interest to both distributed computing and cryptography community. Following well-known results from the distributed computing literature, BA problem in the asynchronous network setting encounters inevitable ...