Tame the wild with byzantine linearizability: Reliable broadcast, snapshots, and asset transfer

Shir Cohen, Idit Keidar

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We formalize Byzantine linearizability, a correctness condition that specifies whether a concurrent object with a sequential specification is resilient against Byzantine failures. Using this definition, we systematically study Byzantine-tolerant emulations of various objects from registers. We focus on three useful objects– reliable broadcast, atomic snapshot, and asset transfer.

Original languageEnglish
Title of host publication35th International Symposium on Distributed Computing, DISC 2021
EditorsSeth Gilbert
Pages18:1-18:18
ISBN (Electronic)9783959772105
DOIs
StatePublished - 1 Oct 2021
Event35th International Symposium on Distributed Computing, DISC 2021 - Virtual, Freiburg, Germany
Duration: 4 Oct 20218 Oct 2021

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume209

Conference

Conference35th International Symposium on Distributed Computing, DISC 2021
Country/TerritoryGermany
CityVirtual, Freiburg
Period4/10/218/10/21

Keywords

  • Asset transfer
  • Byzantine linearizability
  • Concurrent algorithms
  • Snapshot

All Science Journal Classification (ASJC) codes

  • Software

Fingerprint

Dive into the research topics of 'Tame the wild with byzantine linearizability: Reliable broadcast, snapshots, and asset transfer'. Together they form a unique fingerprint.

Cite this