Byzantine agreement in constant expected time

1 January 1985

conference paper
Published by Institute of Electrical and Electronics Engineers (IEEE)

p. 267-276
https://doi.org/10.1109/sfcs.1985.14

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.

Keywords

PROTOCOLS
CLOCKS
CRYPTOGRAPHY
COMPUTER NETWORKS
POLYNOMIALS
COMMUNICATION NETWORKS
DISTRIBUTED COMPUTING

This publication has 0 references indexed in Scilit: