On the nonexistence of resilient consensus protocols

DOI10.1016/0020-0190(91)90221-3zbMATH Open0722.68013OpenAlexW2030843556MaRDI QIDQ756398FDOQ756398

Authors: Gadi Taubenfeld 

Publication date: 1991

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(91)90221-3

Recommendations

• Asynchronous consensus and broadcast protocols
• Impossibility of distributed consensus with one faulty process
• Randomized protocols for asynchronous consensus
• Asynchronous byzantine agreement protocols
• Lower bounds for asynchronous consensus

zbMATH Keywords

fault tolerancecrash failureasynchronous message passing systemsimpossibility proofresilient consensus protocol

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Cites Work

• Impossibility of distributed consensus with one faulty process
• How processes learn
• Title not available (Why is that?)

Cited In (13)

• A constructive proof for FLP
• Title not available (Why is that?)
• Consensus in the presence of mortal Byzantine faulty processes
• Knowledge in shared memory systems.
• A simple bivalency proof that \(t\)-resilient consensus requires \(t+1\) rounds
• Closed schedulers: a novel technique for analyzing asynchronous protocols
• The deformed consensus protocol
• The computational structure of progress conditions and shared objects
• General resilient consensus algorithms
• The fault span of crash failures
• The Complexity Gap between Consensus and Safe-Consensus
• Resilient consensus for infinitely many processes. (Extended abstract)
• Randomized protocols for asynchronous consensus

This page was built for publication: On the nonexistence of resilient consensus protocols

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