Reliable Broadcast despite Mobile Byzantine Faults

2023/11/10 by Silvia Bonomi, Bonomi, Silvia, Giovanni Farina +3
Biochemistry, Genetics and Molecular Biology · Computer Science · #Cryptography and Data Security #DNA and Biological Computing #Distributed #Distributed systems and fault tolerance #FOS: Computer and information sciences #Parallel #and Cluster Computing (cs.DC)

paper · pdf · doi:10.48550/arxiv.2311.05918

openalex publication_date 2023/11/10 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We investigate the solvability of the Byzantine Reliable Broadcast and Byzantine Broadcast Channel problems in distributed systems affected by Mobile Byzantine Faults. We show that both problems are not solvable even in one of the most constrained system models for mobile Byzantine faults defined so far. By endowing processes with an additional local failure oracle, we provide a solution to the Byzantine Broadcast Channel problem.

Related

• BCM-Broadcast: A Byzantine-Tolerant Causal Broadcast Algorithm for Distributed Mobile Systems
• Broadcast Using Certified Propagation Algorithm in Presence of Byzantine Faults
• Reliable Broadcast in Dynamic Networks with Locally Bounded Byzantine Failures
• Practical Byzantine Reliable Broadcast on Partially Connected Networks (Extended version)
• Parameterizable Byzantine Broadcast in Loosely Connected Networks