Consensus with Byzantine Failures and Little System Synchrony

Authors:
Marcos K. Aguilera;Carole Delporte-Gallet;Hugues Fauconnier;Sam Toueg
Affiliations:
HP Laboratories, Palo Alto, California, USA;IGM, ESIEE Paris, France;LIAFA, Universite Paris 7, France;University of Toronto
Venue:
DSN '06 Proceedings of the International Conference on Dependable Systems and Networks
Year:
2006

Citing 0
Cited 9

Tolerating corrupted communication

Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Towards the minimal synchrony for byzantine consensus

Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Stabilizing leader election in partial synchronous systems with crash failures

Journal of Parallel and Distributed Computing
Consensus When All Processes May Be Byzantine for Some Time

SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Unifying Byzantine Consensus Algorithms with Weak Interactive Consistency

OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Byzantine consensus with few synchronous links

OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Robust stabilizing leader election

SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
A necessary and sufficient synchrony condition for solving Byzantine consensus in symmetric networks

ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
The Asynchronous Bounded-Cycle model

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study consensus in a message-passing system where only some of the n^2 links exhibit some synchrony. This problem was previously studied for systems with process crashes; we now consider byzantine failures. We show that consensus can be solved in a system where there is at least one non-faulty process whose links are eventually timely; all other links can be arbitrarily slow. We also show that, in terms of problem solvability, such a system is strictly weaker than one where all links are eventually timely.