Tame the Wild with Byzantine Linearizability: Reliable Broadcast, Snapshots, and Asset Transfer

DOI10.4230/LIPICS.DISC.2021.18MaRDI QIDQ6083380zbMATH OpenOpenAlexFDO

Authors Shir Cohen, Idit Keidar

Publication date 8 December 2023

Full work available at URL https://arxiv.org/abs/2102.10597

zbMATH Keywords

asset transferByzantine linearizabilityconcurrent algorithmssnapshot

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

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. We prove that there is an $f$-resilient implementation of such objects from registers with $n$ processes $f<fracn2$.

Recommendations

• Trading off t-resilience for efficiency in asynchronous Byzantine reliable broadcast
• Simple and efficient asynchronous Byzantine agreement with optimal resilience
• Scalable Byzantine reliable broadcast
• On the versatility of Bracha's Byzantine reliable broadcast algorithm
• Asynchronous Byzantine agreement with optimal resilience

Cited in

(1)

• On implementing SWMR registers from SWSR registers in systems with Byzantine failures

This page was built for publication: Tame the Wild with Byzantine Linearizability: Reliable Broadcast, Snapshots, and Asset Transfer

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6083380)