Building distributed computing abstractions in the presence of mobile byzantine failures

Abstract : In this thesis we consider a model where Byzantine failures are not fixed, we consider the so called Mobile Byzantine failures. So far, only Consensus problem has been solved in presence of Mobile Byzantine failures and interestingly different variations of this failure model have been proposed. For each of them have been proved lower bounds on the number of required processes and have been proposed tight solutions. Our first contribution concerns distributed Registers in such strong model. Distributed Registers are the basic abstraction for Distributed Storages. This advocates our second and main contribution, a general Mobile Byzantine Failure Model. Our main focus is about Distributed Registers, so our third contribution comes, we prove necessities and impossibilities in those models. In particular we prove that is it not possible to solve the weakest register specification in an asynchronous system. On the other side we prove lower bounds for the synchronous system, with respect to the proposed hierarchy models, and tight protocols to solve the Regular Register problem. To conclude, our last contribution is about the Approximate Agreement problem, a weaker form of Consensus. We solve such problem in the same round-based models as Consensus so far. The interesting result is the following, in presence of static Byzantine failures, lower bounds on the number of correct replicas does not change between consensus and approximate agreement. The same invariant still holds in presence of Mobile Byzantine failure. Moreover, along with lower bounds we propose a tight solution to solve approximate agreement.
Complete list of metadatas

Cited literature [50 references]  Display  Hide  Download

https://tel.archives-ouvertes.fr/tel-01653090
Contributor : Abes Star <>
Submitted on : Friday, December 1, 2017 - 9:06:34 AM
Last modification on : Friday, March 22, 2019 - 1:31:44 AM

File

2017PA066159.pdf
Version validated by the jury (STAR)

Identifiers

  • HAL Id : tel-01653090, version 1

Citation

Antonella del Pozzo. Building distributed computing abstractions in the presence of mobile byzantine failures. Networking and Internet Architecture [cs.NI]. Université Pierre et Marie Curie - Paris VI, 2017. English. ⟨NNT : 2017PA066159⟩. ⟨tel-01653090⟩

Share

Metrics

Record views

359

Files downloads

102