Computer Science
Broadcast using certified propagation algorithm in presence of Byzantine faults
Document Type
Article
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.
Publication Title
Information Processing Letters
Publication Date
2015
Volume
115
Issue
4
First Page
512
Last Page
514
ISSN
0020-0190
DOI
10.1016/j.ipl.2014.11.010
Keywords
Byzantine broadcast, CPA, distributed computing, tight condition
Repository Citation
Tseng, Lewis; Vaidya, Nitin; and Bhandari, Vartika, "Broadcast using certified propagation algorithm in presence of Byzantine faults" (2015). Computer Science. 153.
https://commons.clarku.edu/faculty_computer_sciences/153
APA Citation
Tseng, L., Vaidya, N., & Bhandari, V. (2015). Broadcast using certified propagation algorithm in presence of byzantine faults. Information Processing Letters, 115(4), 512-514.
