Skip to Main content Skip to Navigation

Tight Mobile Byzantine Tolerant Atomic Storage

Silvia Bonomi 1, * Antonella del Pozzo 1, 2, * Maria Potop-Butucaru 2, *
* Corresponding author
2 NPA - Networks and Performance Analysis
LIP6 - Laboratoire d'Informatique de Paris 6
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.
Complete list of metadata

Cited literature [15 references]  Display  Hide  Download
Contributor : Maria Potop-Butucaru <>
Submitted on : Monday, May 25, 2015 - 5:48:54 PM
Last modification on : Friday, January 8, 2021 - 5:38:04 PM
Long-term archiving on: : Monday, September 14, 2015 - 7:16:25 PM


Files produced by the author(s)


  • HAL Id : hal-01148872, version 1
  • ARXIV : 1505.06865


Silvia Bonomi, Antonella del Pozzo, Maria Potop-Butucaru. Tight Mobile Byzantine Tolerant Atomic Storage. [Research Report] UPMC, Sorbonne Universites CNRS. 2015. ⟨hal-01148872⟩



Record views


Files downloads