Approximate Agreement under Mobile Byzantine Faults - Sorbonne Université Access content directly
Journal Articles Theoretical Computer Science Year : 2019

Approximate Agreement under Mobile Byzantine Faults

Abstract

In this paper, we address the Approximate Agreement problem in the Mobile Byzantine Fault model. Our contribution is three-fold. First, we refine the problem specification to adapt it to the Mobile Byzantine Fault environment. Then, we propose the first mapping from the existing variants of Mobile Byzantine models to the Mixed-mode Fault model. This mapping further help us to prove the correctness of MSR (Mean-Subsequence-Reduce) algorithms class in our context and it is of independent interest. We also prove lower bounds for solving Approximate Agreement under all existing Mobile Byzantine fault models.

Dates and versions

hal-02076370 , version 1 (22-03-2019)

Identifiers

Cite

Silvia Bonomi, Antonella del Pozzo, Maria Potop-Butucaru, Sébastien Tixeuil. Approximate Agreement under Mobile Byzantine Faults. Theoretical Computer Science, 2019, 758, pp.17-29. ⟨10.1016/j.tcs.2018.08.001⟩. ⟨hal-02076370⟩
88 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More