Efficient Unconditional Asynchronous Byzantine Agreement with Optimal ResilienceAsynchronous Byzantine Agreement Protocol • July 9th, 2012
n = 3t +1 parties over a completely asynchronous network, tolerating a computationally unbounded Byzantine adver- sary, who can control at most t parties out of the n parties. The amortized communication complexity of our ABA pro- tocol is (n3 log 1 ) bits for attaining agreement on a sin- gle bit, where ϵ (ϵ > 0) denotes the probability of non- termination. We compare our protocol with the best known optimally resilient ABA protocols of Canetti et al. (STOC 1993) and Abraham et al. (PODC 2008) and show that our protocol gains by a factor of O(n8(log 1 )3) over the ABA protocol of Canetti et al. and by a factor of O(n5 log n ) over
