Tight bound on mobile Byzantine Agreement

Abstract : This paper investigates the problem of Byzantine Agreement in a synchronous system where malicious agents can move from process to process, corrupting their host. Earlier works on the problem are based on biased models which, as we argue in the paper, give an unfair advantage either to the correct processes or to the adversary controlling the malicious agents. Indeed, earlier studies of the problem assume that, after a malicious agent has left a process, that process, said to be cured, is able to instantly and accurately detect the fact that it was corrupted in earlier rounds, and thus can take local actions to recover a valid state (Garay's model). We found no justification for that assumption which clearly favors correct processes. Under that model, an algorithm is known for n>4t, where n is the number of processes and t the maximum number of malicious agents. The tightness of the bound is however unknown. In contrast, more recent works on the problem remove the assumption on detection and assume instead that a malicious agent may have left corrupted messages in the send queue of a cured process in addition to a corrupted state. As a result, the adversary controlling the malicious agents can corrupt the messages sent by cured processes, in addition to those sent by the newly corrupted ones, thus doubling the number of effective faults. Under that model, which favors the malicious agents, the problem can be solved if and only if n>6t. In this paper, we refine the latter model to avoid the above biases. While a cured process may send messages (based on a state corrupted by the malicious agent), it will behave correctly in the way it sends those messages: i.e., send messages according to the algorithm. Surprisingly, in this model we could derive a new non-trivial tight bound for Byzantine Agreement. We prove that at least 5t+1 processors are needed in order to tolerate t mobile Byzantine agents and provide a time optimal algorithm that matches this lower bound, altogether with a formal specification of the problem.
Type de document :
Article dans une revue
Theoretical Computer Science, Elsevier, 2016, pp.361-373
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01340236
Contributeur : Maria Potop-Butucaru <>
Soumis le : jeudi 30 juin 2016 - 16:06:00
Dernière modification le : jeudi 21 mars 2019 - 14:38:56

Identifiants

  • HAL Id : hal-01340236, version 1

Citation

Francois Bonnet, Xavier Défago, Thanh Dang Nguyen, Maria Potop-Butucaru. Tight bound on mobile Byzantine Agreement. Theoretical Computer Science, Elsevier, 2016, pp.361-373. 〈hal-01340236〉

Partager

Métriques

Consultations de la notice

121