Skip to main content
Conference ProceedingsOPEN ACCESS

On expected constant-round protocols for byzantine agreement

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2006) 4117 LNCS 445-462
DOI: 10.1007/11818175_27
67Citations
Citations of this article
35Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In a seminal paper, Feldman and Micali (STOC '88) show an n-party Byzantine agreement protocol tolerating t

Cite

CITATION STYLE

APA

Katz, J., & Koo, C. Y. (2006). On expected constant-round protocols for byzantine agreement. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4117 LNCS, pp. 445–462). Springer Verlag. https://doi.org/10.1007/11818175_27

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