Consensus in the presence of mortal Byzantine faulty processes
type: Item
instance of: scholarly article
title: Consensus in the presence of mortal Byzantine faulty processes
zbMATH Open document ID: 1255.68043
author: Josef Widder
author: Martin Biely
author: Günther Gridling
author: Bettina Weiss
author: Jean-Paul Blanquart
published in: Distributed Computing
publication date: 2012-06-07T00:00:00Z
Mathematics Subject Classification ID: 68M14
Mathematics Subject Classification ID: 68M15
Mathematics Subject Classification ID: 68W15
zbMATH DE Number: 6043224
zbMATH Keywords: consensus
zbMATH Keywords: Byzantine fault
zbMATH Keywords: distributed algorithm
zbMATH Keywords: fault tolerance
zbMATH Keywords: complexity
MaRDI profile type: Publication
full work available at URL: s00446-011-0147-3
OpenAlex ID: W2167979110
cites work: Uniform consensus is harder than consensus
cites work: Fast fault-tolerant agreement algorithms
cites work: Q3126969
cites work: The Byzantine Generals Problem
cites work: Easy impossibility proofs for distributed consensus problems
cites work: A lower bound for the time to assure interactive consistency
cites work: Unreliable failure detectors for reliable distributed systems
cites work: Early stopping in Byzantine agreement
cites work: Decomposition of distributed programs into communication-closed layers
cites work: Asynchronous consensus and broadcast protocols
cites work: Impossibility of distributed consensus with one faulty process
cites work: Distributed agreement in the presence of processor and communication faults
cites work: The Byzantine generals strike again
cites work: From partial consistency to global broadcast
cites work: Reaching Agreement in the Presence of Faults
cites work: Low complexity Byzantine-resilient consensus
cites work: Q3045849
cites work: New hybrid fault models for asynchronous approximate agreement
cites work: The weakest failure detector for solving consensus
cites work: In search of lost time
cites work: Consensus in Byzantine asynchronous systems
cites work: Byzantine Fault Detectors for Solving Consensus
cites work: From Crash-Stop to Permanent Omission: Automatic Transformation and Weakest Failure Detectors
cites work: From binary consensus to multivalued consensus in asynchronous message-passing systems
cites work: Bounded cost algorithms for multivalued consensus using binary consensus instances
DOI: 10.1007/S00446-011-0147-3
Recommended article: Consensus in Byzantine asynchronous systems
Recommended article: Byzantine Fault Detectors for Solving Consensus
Recommended article: Consensus when all processes may be Byzantine for some time
Recommended article: Error-free multi-valued consensus with byzantine failures
Recommended article: On the nonexistence of resilient consensus protocols
Recommended article: Efficient Byzantine Agreement with Faulty Minority
Recommended article: Unconditional Byzantine agreement for any number of faulty processors
description: scientific article; zbMATH DE number 6043224