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

02/21/2021
by   Shir Cohen, et al.
0

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<n/2.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/26/2020

Appending Atomically in Byzantine Distributed Ledgers

A Distributed Ledger Object (DLO) is a concurrent object that maintains ...
research
03/21/2019

Multi-hop Byzantine Reliable Broadcast Made Practical

We revisit Byzantine tolerant reliable broadcast algorithms in multi-hop...
research
07/04/2022

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

The implementation of registers from (potentially) weaker registers is a...
research
11/05/2018

Reliable Broadcast in Dynamic Networks with Locally Bounded Byzantine Failures

Ensuring reliable communication despite possibly malicious participants ...
research
05/10/2023

Let It TEE: Asynchronous Byzantine Atomic Broadcast with n ≥ 2f+1

Asynchronous Byzantine Atomic Broadcast (ABAB) promises, in comparison t...
research
09/27/2022

Oracular Byzantine Reliable Broadcast [Extended Version]

Byzantine Reliable Broadcast (BRB) is a fundamental distributed computin...
research
04/20/2023

Byzantine-Resilient Learning Beyond Gradients: Distributing Evolutionary Search

Modern machine learning (ML) models are capable of impressive performanc...

Please sign up or login with your details

Forgot password? Click here to reset