Approximate Agreement under Mobile Byzantine Faults

Abstract : In this paper we address Approximate Agreement problem in the Mobile Byzantine faults model. Our contribution is threefold. First, we propose the the first mapping from the existing variants of Mobile Byzantine models to the Mixed-Mode faults model.This mapping further help us to prove the correctness of class MSR (Mean-Subsequence-Reduce) Approximate Agreement algorithms in the Mobile Byzantine fault model, and is of independent interest. Secondly, we prove lower bounds for solving Approximate Agreement under all existing Mobile Byzantine faults models. Interestingly, these lower bounds are different from the static bounds. Finally, we propose matching upper bounds. Our paper is the first to link the Mobile Byzantine Faults models and the Mixed-Mode Faults models, and we advocate that a similar approach can be adopted in order to prove the correctness of other classical distributed building blocks (e.g. agreement, clock synchronization, interactive consistency etc) under Mobile Byzantine Faults model.
Complete list of metadatas

Cited literature [24 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01301597
Contributor : Maria Potop-Butucaru <>
Submitted on : Tuesday, April 12, 2016 - 3:01:01 PM
Last modification on : Thursday, March 21, 2019 - 1:09:12 PM
Long-term archiving on : Wednesday, July 13, 2016 - 11:01:05 AM

Files

AA.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01301597, version 1
  • ARXIV : 1604.03871

Citation

Silvia Bonomi, Antonella del Pozzo, Maria Potop-Butucaru, Sébastien Tixeuil. Approximate Agreement under Mobile Byzantine Faults. 2015. ⟨hal-01301597⟩

Share

Metrics

Record views

130

Files downloads

192