On the impact of link faults on Byzantine agreement

DOI10.1016/J.IC.2014.10.001zbMATH Open1309.68211OpenAlexW2130886452MaRDI QIDQ476176FDOQ476176

Authors: Martin Biely 

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

Recommendations

• Distributed agreement in the presence of processor and communication faults
• A new solution for the Byzantine generals problem
• Agreement in synchronous networks with ubiquitous faults
• Fault Tolerance in Networks of Bounded Degree
• Impossibility Results and Lower Bounds for Consensus under Link Failures

zbMATH Keywords

consensusByzantine faultsfault modelsfault-tolerant distributed algorithmslink faults

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Cites Work

• Dynamic graph models
• Hundreds of impossibility results for distributed computing
• Impossibility of distributed consensus with one faulty process
• Reaching Agreement in the Presence of Faults
• The Byzantine generals strike again
• Title not available (Why is that?)
• An efficient algorithm for byzantine agreement without authentication
• The Heard-Of model: computing in distributed systems with benign faults
• Automatically increasing the fault-tolerance of distributed algorithms
• Easy impossibility proofs for distributed consensus problems
• Booting clock synchronization in partially synchronous systems with hybrid process and link failures
• Coordinated consensus in dynamic networks
• Simplifying fault-tolerance, providing the abstraction of crash failures
• Impossibility Results and Lower Bounds for Consensus under Link Failures
• Title not available (Why is that?)
• Fast Distributed Agreement
• Time is not a healer (preliminary version)
• Fully polynomial Byzantine agreement in t + 1 rounds
• Tolerating corrupted communication
• Synchronous consensus under hybrid process and link failures

Cited In (6)

• Title not available (Why is that?)
• Making fault-sensitive algorithms tolerate link failures
• Are Byzantine failures really different from crash failures?
• Tolerating Random Byzantine Failures in an Unbounded Network
• The sum of its parts: analysis of federated Byzantine agreement systems
• Distributed agreement in the presence of processor and communication faults

This page was built for publication: On the impact of link faults on Byzantine agreement

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q476176)