Broadcast using certified propagation algorithm in presence of Byzantine faults

Lewis Tseng, Nitin Vaidya, Vartika Bhandari

Research output: Contribution to journalArticlepeer-review

Abstract

We explore the correctness of the Certified Propagation Algorithm (CPA) [6,1,8,5] in solving broadcast with locally bounded Byzantine faults. CPA allows the nodes to use only local information regarding the network topology. We provide a tight necessary and sufficient condition on the network topology for the correctness of CPA.

Original languageEnglish (US)
Pages (from-to)512-514
Number of pages3
JournalInformation Processing Letters
Volume115
Issue number4
DOIs
StatePublished - Apr 2015

Keywords

  • Byzantine broadcast
  • CPA
  • Distributed computing
  • Tight condition

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications

Fingerprint Dive into the research topics of 'Broadcast using certified propagation algorithm in presence of Byzantine faults'. Together they form a unique fingerprint.

Cite this