Objects Shared by Byzantine Processes

Work to date on algorithms for message-passing systems has explored a wide variety of types of faults, but corresponding work on shared memory systems has usually assumed that only crash faults are possible. In this work, we explore situations in which processes accessing shared objects can fail arbitrarily (Byzantine faults).

• Type: Conference
• Year: 2000
• Where: WDAG
• Authors: Dahlia Malkhi, Michael Merritt, Michael K. Reiter, Gadi Taubenfeld
• Keywords: Algorithms, Byzantine Faults, Crash Faults, Message-passing Systems, WDAG 2000