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).

Authors and Affiliations

1. School of Computer Science and Engineering, The Hebrew University of Jerusalem, Israel (e-mail: dalia@cs.huji.ac.il) , , , , , , IL

   Dahlia Malkhi

2. AT&T Labs, 180 Park Ave., Florham Park, NJ 07932-0971, USA (e-mail: mischu@research.att.com) , , , , , , US

   Michael Merritt

3. Department of Electrical and Computer Engineering and Department of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213, USA (e-mail: reiter@cmu.edu) , , , , , , US

   Michael K. Reiter

4. The Open University and the Interdisciplinary Center, Israel (e-mail: gadi@cs.openu.ac.il) , , , , , , IL

   Gadi Taubenfeld

Received: December 2000 / Accepted: July 2002

RID="*"

ID="*" A preliminary version of the results presented in this paper appeared in Proceedings of the 14th International Symposium on Distributed Computing, Toledo, Spain, October 2000.

Reprints and permissions