Byzantine-Tolerant Reliable Broadcast in the Presence of Silent Churn
From MaRDI portal
Publication:6488432
DOI10.1007/978-3-030-91081-5_2zbMath1521.68017MaRDI QIDQ6488432
Timothé Albouy, Davide Frey, Michel Raynal, François Taïani
Publication date: 21 April 2023
Network design and communication in computer systems (68M10) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (2)
Asynchronous Byzantine reliable broadcast with a message adversary ⋮ Self-stabilizing Byzantine fault-tolerant repeated reliable broadcast
Cites Work
- Asynchronous byzantine agreement protocols
- The Heard-Of model: computing in distributed systems with benign faults
- Agreement in synchronous networks with ubiquitous faults
- Introduction to Reliable and Secure Distributed Programming
- Asynchronous consensus and broadcast protocols
- Reaching Agreement in the Presence of Faults
- The Byzantine Generals Problem
- Trading off t-Resilience for Efficiency in Asynchronous Byzantine Reliable Broadcast
- On the Versatility of Bracha’s Byzantine Reliable Broadcast Algorithm
- Time is not a healer
- Synchrony weakened by message adversaries vs asynchrony restricted by failure detectors
- Fault-Tolerant Message-Passing Distributed Systems
- Scalable Byzantine reliable broadcast
This page was built for publication: Byzantine-Tolerant Reliable Broadcast in the Presence of Silent Churn
