Asynchronous Byzantine Agreement with Optimal ResilienceAsynchronous Byzantine Agreement • October 11th, 2013
Contract Type FiledOctober 11th, 2013Abstract We present an efficient, optimally-resilient Asyn- chronous Byzantine Agreement (ABA) protocol involving n = 3t + 1 parties over a completely asynchronous network, tolerating a computationally unbounded Byzantine adver- sary, capable of corrupting at most t out of the n parties. In comparison with the best known optimally-resilient ABA protocols of Canetti and Rabin (STOC 1993) and Abraham, Dolev and Halpern (PODC 2008), our protocol is signifi- cantly more efficient in terms of the communication com- plexity.