Efficient Distributed Consensus with n = (3 + epsilon) t Processors (Extended Abstract)

Fully polynomial Byzantine agreement in t + 1 rounds

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing

An randomized Byzantine agreement protocol with constant expected time and guaranteed termination in optimal (deterministic) time

PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing

Optimal time Byzantine agreement for t n/8 with linear-messages

Distributed Computing

Synchronous byzantine agreement with nearly a cubic number of communication bits: synchronous byzantine agreement with nearly a cubic number of communication bits

Proceedings of the 2013 ACM symposium on Principles of distributed computing