Consensus in the presence of mortal Byzantine faulty processes
From MaRDI portal
Publication:424903
DOI10.1007/S00446-011-0147-3zbMATH Open1255.68043OpenAlexW2167979110MaRDI QIDQ424903FDOQ424903
Authors: Josef Widder, Martin Biely, Günther Gridling, Bettina Weiss, Jean-Paul Blanquart 
Publication date: 7 June 2012
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-011-0147-3
Recommendations
- Consensus in Byzantine asynchronous systems
- Byzantine Fault Detectors for Solving Consensus
- Consensus when all processes may be Byzantine for some time
- Error-free multi-valued consensus with Byzantine failures
- On the nonexistence of resilient consensus protocols
- Efficient Byzantine Agreement with Faulty Minority
- Unconditional Byzantine agreement for any number of faulty processors (extended abstract)
Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15) Distributed systems (68M14)
Cites Work
- Title not available (Why is that?)
- Unreliable failure detectors for reliable distributed systems
- From binary consensus to multivalued consensus in asynchronous message-passing systems
- Early stopping in Byzantine agreement
- Impossibility of distributed consensus with one faulty process
- Reaching Agreement in the Presence of Faults
- The Byzantine Generals Problem
- The Byzantine generals strike again
- The weakest failure detector for solving consensus
- A lower bound for the time to assure interactive consistency
- Asynchronous consensus and broadcast protocols
- Decomposition of distributed programs into communication-closed layers
- Easy impossibility proofs for distributed consensus problems
- In search of lost time
- Consensus in Byzantine asynchronous systems
- Low complexity Byzantine-resilient consensus
- Title not available (Why is that?)
- From partial consistency to global broadcast
- From Crash-Stop to Permanent Omission: Automatic Transformation and Weakest Failure Detectors
- Distributed agreement in the presence of processor and communication faults
- Byzantine Fault Detectors for Solving Consensus
- New hybrid fault models for asynchronous approximate agreement
- Uniform consensus is harder than consensus
- Fast fault-tolerant agreement algorithms
- Bounded cost algorithms for multivalued consensus using binary consensus instances
Cited In (8)
- Tutorial on Parameterized Model Checking of Fault-Tolerant Distributed Algorithms
- Active fault tolerant control systems by the semi‐Markov model approach
- The Do-All problem with Byzantine processor failures
- Brief Announcement: Byzantine Geoconsensus
- Consensus when all processes may be Byzantine for some time
- Are Byzantine failures really different from crash failures?
- Paxos consensus, deconstructed and abstracted
- Consensus using omega in asynchronous systems with unknown membership and degenerative Byzantine failures
This page was built for publication: Consensus in the presence of mortal Byzantine faulty processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q424903)
