Broadcast using certified propagation algorithm in presence of Byzantine faults

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. •We explore using Certified Propagation Algorithm (CPA) to achieve broadcast.•The fault model we considered is the locally bounded Byzantine faults.•We identify a tight necessary and sufficient condition on the network topology.•We also propose extensions of the results.