Byzantine Fault Detectors for Solving Consensus
From MaRDI portal
Recommendations
- Unreliable failure detectors for reliable distributed systems
- A simple and fast asynchronous consensus protocol based on a weak failure detector
- Consensus in Byzantine asynchronous systems
- Early consensus in an asynchronous system with a weak failure detector
- The weakest failure detector for solving consensus
Cited in
(34)- The Do-All problem with Byzantine processor failures
- A flexible formal framework for masking/demasking faults
- Consensus in Byzantine asynchronous systems
- Low complexity Byzantine-resilient consensus
- Consensus using omega in asynchronous systems with unknown membership and degenerative Byzantine failures
- Order-fairness for Byzantine consensus
- The deformed consensus protocol
- Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with \(t<n/3\), \(O(n^2)\) messages, and constant time
- Distributed consensus in the presence of sectional faults
- scientific article; zbMATH DE number 2088918 (Why is no real title available?)
- Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with \(t<n/3\), \(O(n^{2})\) messages, and constant time
- On Self-stabilizing Synchronous Actions Despite Byzantine Attacks
- A New Solution to Detectable Byzantine Agreement Problem
- scientific article; zbMATH DE number 5506092 (Why is no real title available?)
- Consensus in the presence of mortal Byzantine faulty processes
- On Byzantine generals with alternative plans
- Unreliable failure detectors for reliable distributed systems
- An introduction to oracles for asynchronous distributed systems
- scientific article; zbMATH DE number 7561269 (Why is no real title available?)
- Hybrid fault-tolerant consensus in asynchronous and wireless embedded systems
- A hybrid protocol to solve authenticated Byzantine consensus
- Byzantine Fault Tolerant Distributed Quickest Change Detection
- Efficient Byzantine Sequential Change Detection
- Theoretical Aspects of Computing – ICTAC 2005
- Consensus when all processes may be Byzantine for some time
- Byzantine fault tolerant symmetric-persistent circle evacuation
- Byzantine fault tolerant symmetric-persistent circle evacuation
- Distributed computing in asynchronous networks with byzantine edges
- On the Validity of Consensus
- Brief Announcement: Byzantine Geoconsensus
- Byzantine consensus is \(\Theta(n^2)\): the Dolev-Reischuk bound is tight even in partial synchrony!
- Liveness and latency of Byzantine state-machine replication
- The economic limits of permissionless consensus
- Correctness and fairness of committee-based blockchains: a case study of Tendermint's repeated consensus
This page was built for publication: Byzantine Fault Detectors for Solving Consensus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4415929)
