Efficient algorithms for byzantine agreement

The Byzantine Agreement problem arises in systems composed of n indipendent cooperating processes, of which at most t can fail, exhibiting unpredictable behaviour. Each process in the system is able to communicate with any other only by message passing; besides, they have independent failure modes and do not know what other processes are faulty.