Byzantine agreement in the full-information model in O(log n) rounds


We present a randomized Byzantine Agreement (BA) protocol with an expected running time of O(log n) rounds, in a synchronous <i>full-information</i> network of n players. For any constant &#949; &gt; 0, the constructed protocol tolerates t non-adaptive Byzantine faults, as long as n &#8805; (4 + &#949;)t. In the full-information model, no restrictions are… (More)
DOI: 10.1145/1132516.1132543


1 Figure or Table