Abstract
This paper presents a polynomial protocol for reaching Byzantine agreement in t + 1 rounds whenever n > 3t, where n is the number of processors and t is an a priori upper bound on the number of failures. This resolves an open problem presented by Pease, Shostak and Lamport in 1980.
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for freeCite
CITATION STYLE
APA
Garay, J. A., & Moses, Y. (1993). Fully polynomial byzantine agreement in t + 1 rounds. In Proceedings of the Annual ACM Symposium on Theory of Computing (Vol. Part F129585, pp. 31–41). Association for Computing Machinery. https://doi.org/10.1145/167088.167101
Readers' Seniority
Readers' Discipline
