Optimal Algorithms for Byzantine Agreement

We exhibit randomized Byzantine agreement (BA) algorithms achieving optimal running time and fault tolerance against all types of adversaries ever considered in the literature. Our BA algorithms do not require trusted parties, preprocessing, or non-constructive arguments.

Authors

• Paul Feldman
• Silvio Micali

Keywords

No keywords are indexed for this paper.