Brief announcement: Approximate Agreement under Mobile Byzantine Faults Model

Silvia Bonomi 1 Antonella del Pozzo 1, 2 Maria Potop-Butucaru 2, 3 Sébastien Tixeuil 4, 2, 3, 5, 6
1 DIAG - Sapienza University of Rome
2 NPA - Networks and Performance Analysis
LIP6 - Laboratoire d'Informatique de Paris 6
3 LIP6 - Laboratoire d'Informatique de Paris 6
4 UPMC - Université Pierre et Marie Curie - Paris 6
5 IUF - Institut Universitaire de France
6 LINCS - Laboratory of Information, Network and Communication Sciences
Abstract : This paper considers the Approximate Agreement problem in presence of mobile Byzantine agents. We prove lower bounds on the number of correct processes to solve such problem. To do that we prove that the existing solutions tolerant to Byzantine agents still holds in such case and under which conditions.
Document type :
Poster communications
Complete list of metadatas
https://hal.sorbonne-universite.fr/hal-01349092
Contributor : Sébastien Tixeuil <>
Submitted on : Tuesday, July 26, 2016 - 4:34:17 PM
Last modification on : Wednesday, December 18, 2019 - 5:33:52 PM

Identifiers

Collections

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

Citation

Silvia Bonomi, Antonella del Pozzo, Maria Potop-Butucaru, Sébastien Tixeuil. Brief announcement: Approximate Agreement under Mobile Byzantine Faults Model. IEEE Conference on Distributed Computing Systems (ICDCS 2016), Jun 2016, Nara, Japan. IEEE, pp.727-728, ⟨10.1109/ICDCS.2016.68⟩. ⟨hal-01349092⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

561

Contact

Informations

CCSD