Efficient Algorithms for Anonymous Byzantine Agreement

Authors:
Michael Okun;Amnon Barak
Affiliations:
The Hebrew University of Jerusalem, School of Computer Science, 91904, Jerusalem, Israel;The Hebrew University of Jerusalem, School of Computer Science, 91904, Jerusalem, Israel
Venue:
Theory of Computing Systems
Year:
2008

Citing 0
Cited 4

On the round complexity of Byzantine agreement without initial set-up

Information and Computation
Brief announcement: byzantine agreement with homonyms

Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Byzantine agreement with homonyms

Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Renaming in message passing systems with byzantine failures

DISC'06 Proceedings of the 20th international conference on Distributed Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper considers the Byzantine agreement problem in a completely connected network of anonymous processors. In this network model the processors have no identifiers and can only detect the link through which a message is delivered. We present a polynomial-time agreement algorithm that requires 3⌊(n−t)t/(n−2t)⌋+4 rounds, where n3t is the number of processors and t is the maximal number of faulty processors that the algorithm can tolerate. We also present an early-stopping variant of the algorithm.