Fast byzantine agreement

Authors:
Nicolas Braud-Santoni;Rachid Guerraoui;Florian Huc
Affiliations:
École Polytechnique Fédérale de Lausanne, Lausanne, Switzerland & ENS de Cachan, Brittany campus, Bruz, France;École Polytechnique Fédérale de Lausanne, Lausanne, Switzerland;École Polytechnique Fédérale de Lausanne, Lausanne, Switzerland
Venue:
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Year:
2013

Citing 15
Cited 2

Fault tolerance in networks of bounded degree

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
The isoperimetric number of random regular graphs

European Journal of Combinatorics
Bounds on information exchange for Byzantine agreement

Journal of the ACM (JACM)
Fully Polynomial Byzantine Agreement for Processors in Rounds

SIAM Journal on Computing
Randomness-optimal oblivious sampling

Proceedings of the workshop on Randomized algorithms and computation
Reaching Agreement in the Presence of Faults

Journal of the ACM (JACM)
The Byzantine Generals Problem

ACM Transactions on Programming Languages and Systems (TOPLAS)
Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols

PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Byzantine agreement in the full-information model in O(log n) rounds

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Towards Secure and Scalable Computation in Peer-to-Peer Networks

FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Randomized byzantine generals

SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
From almost everywhere to everywhere: byzantine agreement with Õ(n³/²) bits

DISC'09 Proceedings of the 23rd international conference on Distributed computing
Brief announcement: communication efficient asynchronous byzantine agreement

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Load balanced scalable Byzantine agreement through quorum building, with full information

ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
Byzantine agreement in polynomial expected time: [extended abstract]

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

PODC 2013 review

ACM SIGACT News
Bremen workshop review

ACM SIGACT News

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents the first probabilistic Byzantine Agreement algorithm whose communication and time complexities are poly-logarithmic. So far, the most effective probabilistic Byzantine Agreement algorithm had communication complexity Õ(√n) and time complexity Õ(1). Our algorithm is based on a novel, unbalanced, almost-everywhere to everywhere Agreement protocol which is interesting in its own right.