Broadcast using certified propagation algorithm in presence of Byzantine faults

DOI10.1016/j.ipl.2014.11.010zbMath1312.68024arXiv1209.4620OpenAlexW2137371618MaRDI QIDQ2512829

Lewis Tseng, Nitin H. Vaidya, Vartika Bhandari

Publication date: 30 January 2015

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1209.4620

zbMATH Keywords

distributed computingCPAByzantine broadcasttight condition

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (3)

Reliable broadcast with respect to topology knowledge ⋮ Broadcast using certified propagation algorithm in presence of Byzantine faults ⋮ Determining \(r\)- and \((r,s)\)-robustness of digraphs using mixed integer linear programming

Cites Work

• Unnamed Item
• A new parameter for a broadcast algorithm with locally bounded Byzantine faults
• Broadcasting with locally bounded byzantine faults
• Broadcast using certified propagation algorithm in presence of Byzantine faults
• Iterative approximate byzantine consensus in arbitrary directed graphs
• Reaching approximate agreement in the presence of faults
• Impossibility of distributed consensus with one faulty process
• On reliable broadcast in a radio network
• Reliable Broadcast with Respect to Topology Knowledge
• Broadcast in radio networks tolerating byzantine adversarial behavior

This page was built for publication: Broadcast using certified propagation algorithm in presence of Byzantine faults