Efficient algorithms for anonymous byzantine agreement

Michael Okun*, Amnon Barak

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

15 Scopus citations

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 n>3t 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.

Original languageEnglish
Pages (from-to)222-238
Number of pages17
JournalTheory of Computing Systems
Volume42
Issue number2
DOIs
StatePublished - Feb 2008

Keywords

  • Anonymous distributed algorithms
  • Anonymous networks
  • Byzantine agreement
  • Distributed fault tolerant computing

Fingerprint

Dive into the research topics of 'Efficient algorithms for anonymous byzantine agreement'. Together they form a unique fingerprint.

Cite this