On the impact of link faults on Byzantine agreement
From MaRDI portal
Publication:476176
DOI10.1016/j.ic.2014.10.001zbMath1309.68211OpenAlexW2130886452MaRDI QIDQ476176
Publication date: 28 November 2014
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2014.10.001
Cites Work
- Unnamed Item
- Unnamed Item
- Synchronous consensus under hybrid process and link failures
- Easy impossibility proofs for distributed consensus problems
- Dynamic graph models
- Booting clock synchronization in partially synchronous systems with hybrid process and link failures
- The Heard-Of model: computing in distributed systems with benign faults
- Coordinated consensus in dynamic networks
- Simplifying fault-tolerance
- Automatically increasing the fault-tolerance of distributed algorithms
- Impossibility Results and Lower Bounds for Consensus under Link Failures
- Impossibility of distributed consensus with one faulty process
- Fast Distributed Agreement
- Reaching Agreement in the Presence of Faults
- The Byzantine generals strike again
- An efficient algorithm for byzantine agreement without authentication
- Time is not a healer
- Hundreds of impossibility results for distributed computing
- Fully polynomial Byzantine agreement in t + 1 rounds
- Tolerating corrupted communication
