Consensus in Byzantine asynchronous systems
From MaRDI portal
Recommendations
- Byzantine Fault Detectors for Solving Consensus
- Asynchronous byzantine agreement protocols
- A simple and fast asynchronous consensus protocol based on a weak failure detector
- Signature-free asynchronous binary Byzantine consensus with \(t<n/3\), \(O(n^2)\) messages, and \(O(1)\) expected time
- Asynchronous consensus and broadcast protocols
Cites work
- A simple and fast asynchronous consensus protocol based on a weak failure detector
- Early consensus in an asynchronous system with a weak failure detector
- Impossibility of distributed consensus with one faulty process
- Reaching Agreement in the Presence of Faults
- The weakest failure detector for solving consensus
- Unreliable failure detectors for reliable distributed systems
Cited in
(14)- Bee's strategy against Byzantines. Replacing Byzantine participants (extended abstract)
- Clairvoyant state machine replications
- On Byzantine generals with alternative plans
- Protocols forcing consensus
- Byzantine Fault Detectors for Solving Consensus
- Consensus in the presence of mortal Byzantine faulty processes
- Consensus using omega in asynchronous systems with unknown membership and degenerative Byzantine failures
- Low complexity Byzantine-resilient consensus
- Moving participants turtle consensus
- Order-fairness for Byzantine consensus
- Consensus algorithms with one-bit messages
- A hybrid protocol to solve authenticated Byzantine consensus
- ADAPTIVE AND DOUBLY-EXPEDITED ONE-STEP CONSENSUS IN BYZANTINE ASYNCHRONOUS SYSTEMS
- Paxos consensus, deconstructed and abstracted
This page was built for publication: Consensus in Byzantine asynchronous systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1827288)
