Byzantine agreement in constant expected time

  • Authors:
  • Paul Feldman;Silvio Micali

  • Affiliations:
  • -;-

  • Venue:
  • SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
  • Year:
  • 1985

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present a novel cryptographic algorithm for Byzantine agreement in a network with l=O(n) faulty processors and in the most adversarial setting. Our algorithm requires, once and for all, O(t) rounds of preprocessing. Afterwards it allows us to reach each individual Byzantine agreement in constant expected time. Our solution does not make use of any trusted party.