How to Solve Consensus in the Smallest Window of Synchrony

Authors:
Dan Alistarh;Seth Gilbert;Rachid Guerraoui;Corentin Travers
Affiliations:
EPFL LPD, Lausanne, Switzerland 1015;EPFL LPD, Lausanne, Switzerland 1015;EPFL LPD, Lausanne, Switzerland 1015;Universidad Politecnica de Madrid, Madrid, Spain 28031
Venue:
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Year:
2008

Citing 11
Cited 2

One-way functions are necessary and sufficient for secure signatures

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Applied cryptography (2nd ed.): protocols, algorithms, and source code in C

Applied cryptography (2nd ed.): protocols, algorithms, and source code in C
Reaching Agreement in the Presence of Faults

Journal of the ACM (JACM)
The Byzantine Generals Problem

ACM Transactions on Programming Languages and Systems (TOPLAS)
A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM
Foundations of Cryptography: Basic Tools

Foundations of Cryptography: Basic Tools
Practical byzantine fault tolerance and proactive recovery

ACM Transactions on Computer Systems (TOCS)
Unconditionally Secure Digital Signature Schemes Admitting Transferability

ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
HQ replication: a hybrid quorum protocol for byzantine fault tolerance

OSDI '06 Proceedings of the 7th USENIX Symposium on Operating Systems Design and Implementation - Volume 7
Zyzzyva: speculative byzantine fault tolerance

Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
Bounded wait-free implementation of optimally resilient byzantine storage without (unproven) cryptographic assumptions

DISC'07 Proceedings of the 21st international conference on Distributed Computing

Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Generating fast indulgent algorithms

ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses the following question: what is the minimum-sized synchronous window needed to solve consensus in an otherwise asynchronous system? In answer to this question, we present the first optimally-resilient algorithm ASAPthat solves consensus as soon as possiblein an eventually synchronous system, i.e., a system that from some time GSTonwards, delivers messages in a timely fashion. ASAPguarantees that, in an execution with at most ffailures, every process decides no later than round GST+ f+ 2, which is optimal.