Objects shared by Byzantine processes

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

doi:10.1007/s00446-002-0075-3

Objects shared by Byzantine processes

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

Computer Science discipline

Research output: Contribution to journal › Article › peer-review

Abstract

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

Original language	English
Pages (from-to)	37-48
Number of pages	12
Journal	Distributed Computing
Volume	16
Issue number	1
DOIs	https://doi.org/10.1007/s00446-002-0075-3
State	Published - Feb 2003

Keywords

Byzantine faults
Consensus
Emulation
Shared memory

Access to Document

10.1007/s00446-002-0075-3

Cite this

@article{566d247478b64f628ea49e471f9f1266,

title = "Objects shared by Byzantine processes",

abstract = "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).",

keywords = "Byzantine faults, Consensus, Emulation, Shared memory",

author = "Dahlia Malkhi and Michael Merritt and Reiter, {Michael K.} and Gadi Taubenfeld",

year = "2003",

month = feb,

doi = "10.1007/s00446-002-0075-3",

language = "אנגלית",

volume = "16",

pages = "37--48",

journal = "Distributed Computing",

issn = "0178-2770",

publisher = "Springer Verlag",

number = "1",

}

TY - JOUR

T1 - Objects shared by Byzantine processes

AU - Malkhi, Dahlia

AU - Merritt, Michael

AU - Reiter, Michael K.

AU - Taubenfeld, Gadi

PY - 2003/2

Y1 - 2003/2

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

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

KW - Byzantine faults

KW - Consensus

KW - Emulation

KW - Shared memory

UR - http://www.scopus.com/inward/record.url?scp=0037301826&partnerID=8YFLogxK

U2 - 10.1007/s00446-002-0075-3

DO - 10.1007/s00446-002-0075-3

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0037301826

SN - 0178-2770

VL - 16

SP - 37

EP - 48

JO - Distributed Computing

JF - Distributed Computing

IS - 1

ER -

Objects shared by Byzantine processes

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this