Skip to main content
Conference ProceedingsOPEN ACCESS

Fully polynomial byzantine agreement in t + 1 rounds

Proceedings of the Annual ACM Symposium on Theory of Computing (1993) Part F129585 31-41
DOI: 10.1145/167088.167101
42Citations
Citations of this article
24Readers
Mendeley users who have this article in their library.

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.

Cite

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

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free