A Characterization of Eventual Byzantine Agreement

Authors:
Joseph Y. Halpern;Yoram Moses;Orli Waarts
Affiliations:
-;-;-
Venue:
SIAM Journal on Computing
Year:
2002

Citing 0
Cited 5

Using counterfactuals in knowledge-based programming

Distributed Computing
Compositional competitiveness for distributed algorithms

Journal of Algorithms
Compositional competitiveness for distributed algorithms

Journal of Algorithms
A knowledge-based analysis of global function computation

DISC'06 Proceedings of the 20th international conference on Distributed Computing
Brief announcement: pareto optimal solutions to consensus and set consensus

Proceedings of the 2013 ACM symposium on Principles of distributed computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

We investigate eventual Byzantine agreement (EBA) in the crash and omission failure modes. The emphasis is on characterizing optimal EBA protocols in terms of the states of knowledge required by the processors in order to attain EBA. It is well known that common knowledge among the nonfaulty processors is a necessary and sufficient condition for attaining simultaneous Byzantine agreement (SBA). We define a new variant that we call continual common knowledge and use it to provide necessary and sufficient conditions for attaining EBA. Using this characterization, we provide a technique that allows us to start with any EBA protocol and convert it to an optimal EBA protocol using a two-step process.