Objects shared by Byzantine processes

DOI10.1007/s00446-002-0075-3zbMath1448.68145OpenAlexW1966649196MaRDI QIDQ5138482

Michael Merritt, Dahlia Malkhi, Michael K. Reiter, Gadi Taubenfeld

Publication date: 4 December 2020

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

Full work available at URL: https://doi.org/10.1007/s00446-002-0075-3

zbMATH Keywords

shared memoryconsensusemulationByzantine faults

Mathematics Subject Classification ID

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

Cites Work

• More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
• On k -set consensus problems in asynchronous systems
• Fault-tolerant wait-free shared objects
• Impossibility of distributed consensus with one faulty process
• Computing with faulty shared objects

This page was built for publication: Objects shared by Byzantine processes