Renaming in synchronous message passing systems with Byzantine failures

DOI10.1007/s00446-007-0045-xzbMath1266.68059OpenAlexW2042425246MaRDI QIDQ1954260

Eli Gafni, Michael S. Okun, Amnon B. Barak

Publication date: 20 June 2013

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-007-0045-x

zbMATH Keywords

renaming problemsynchronous message passing modelByzantine failures

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (2)

Strong order-preserving renaming in the synchronous message passing model ⋮ Byzantine agreement with homonyms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Wait-free implementations in message-passing systems
• Wait-free algorithms for fast, long-lived renaming
• Efficient algorithms for anonymous Byzantine agreement
• Adaptive and Efficient Algorithms for Lattice Agreement and Renaming
• The topological structure of asynchronous computability
• Simplifying fault-tolerance
• Renaming in an asynchronous environment
• Automatically increasing the fault-tolerance of distributed algorithms
• Renaming in Message Passing Systems with Byzantine Failures
• Fully-Adaptive Algorithms for Long-Lived Renaming
• Impossibility of distributed consensus with one faulty process
• Electing a leader in a synchronous ring
• Reaching Agreement in the Presence of Faults
• The Byzantine Generals Problem
• A partial equivalence between shared-memory and message-passing in an asynchronous fail-stop distributed environment
• Immediate atomic snapshots and fast renaming
• Time bounds for decision problems in the presence of timing uncertainty and failures

This page was built for publication: Renaming in synchronous message passing systems with Byzantine failures