Broadcast Using Certified Propagation Algorithm in Presence of Byzantine Faults

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Nov 23, 2014
Accession Number
ADA622029

Entities

People

  • Lewis Tseng
  • Nitin H. Vaidya
  • Vartika Bhandari

Organizations

  • University of Illinois Urbana–Champaign

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Communication Channels
  • Communication Networks
  • Computer Science
  • Distributed Computing
  • Information Operations
  • Mathematics
  • Military Research
  • Network Topology
  • Networks
  • Specifications
  • Topology

Fields of Study

  • Computer science

Readers

  • Computer Networking
  • Operations Research