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

Citing 0
Cited 8

A Simple Method for Generating and Sharing Pseudo-Random Functions, with Applications to Clipper-like Escrow Systems

CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
On expected constant-round protocols for Byzantine agreement

Journal of Computer and System Sciences
Scalable byzantine computation

ACM SIGACT News
Leakage-resilient coin tossing

DISC'11 Proceedings of the 25th international conference on Distributed computing
On expected constant-round protocols for byzantine agreement

CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
The vector-ballot approach for online voting procedures

Towards Trustworthy Elections
Brief announcement: byzantine agreement with a strong adversary in polynomial expected time

Proceedings of the 2013 ACM symposium on Principles of distributed computing
Byzantine agreement in polynomial expected time: [extended abstract]

Proceedings of the forty-fifth annual ACM symposium on Theory of computing

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.