Byzantine Agreement by Distributed Randomization in 0(log N) Rounds

Whilst the greatest effort has been made to ensure the quality of this text, due to the historical nature of this content, in some rare cases there may be minor issues with legibility. The Byzantine Agreement (ba) problem is essentially the problem of finding a protocol for reaching agreement among n distributed processes of which at most t may be faulty. BA was defined by Pease, Shostak and Lampo...