Tight Mobile Byzantine Tolerant Atomic Storage

TL;DR

This paper introduces the first implementation of an atomic storage system resilient to mobile Byzantine agents in a round-based synchronous model, analyzing its feasibility and establishing bounds for such dynamic fault-tolerance.

Contribution

It presents a novel implementation and theoretical bounds for mobile Byzantine tolerant atomic storage, addressing a previously unexplored dynamic failure model.

Findings

Feasibility of multi-writer multi-reader atomic register with mobile Byzantine faults

Upper and lower bounds for atomic storage in mobile Byzantine models

Significant differences from static Byzantine fault models

Abstract

This paper proposes the first implementation of an atomic storage tolerant to mobile Byzantine agents. Our implementation is designed for the round-based synchronous model where the set of Byzantine nodes changes from round to round. In this model we explore the feasibility of multi-writer multi-reader atomic register prone to various mobile Byzantine behaviors. We prove upper and lower bounds for solving the atomic storage in all the explored models. Our results, significantly different from the static case, advocate for a deeper study of the main building blocks of distributed computing while the system is prone to mobile Byzantine failures.