Randomized byzantine generals

We present a randomized solution for the Byzantine Generals Problems. The solution works in the synchronous as well as the asynchronous case and produces Byzantine Agreement within a fixed small expected number of computational rounds, independent of the number n of processes and the bound t on the number of faulty processes. The solution uses A. Shamir´s method for sharing secrets. It specializes to produce a simple solution for the Distributed Commit problem.