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.