Skip to Main content Skip to Navigation
Journal articles

Approximate Agreement under Mobile Byzantine Faults

Silvia Bonomi 1 Antonella del Pozzo 2 Maria Potop-Butucaru 3 Sébastien Tixeuil 3, 4
1 DIAG - Sapienza University of Rome
2 DIAG - Dipartimento di Ingegneria informatica automatica e gestionale
3 NPA - Networks and Performance Analysis
LIP6
4 LINCS - Laboratory of Information, Network and Communication Sciences
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.
Document type :
Journal articles
Complete list of metadatas
https://hal.sorbonne-universite.fr/hal-02076370
Contributor : Sébastien Tixeuil <>
Submitted on : Friday, March 22, 2019 - 9:55:27 AM
Last modification on : Friday, January 8, 2021 - 5:38:03 PM

Identifiers

Collections

SORBONNE-UNIVERSITE | CNRS | INRIA | LIP6 | SU-SCIENCES | INSTITUT-TELECOM

Citation

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

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

95