Self-Stabilizing Byzantine-Resilient Communication in Dynamic Networks


Authors / Editors


Research Areas

No matching items found.


Publication Details

Output type: Conference proceeding

UM6P affiliated Publication?: Yes

Author list: Maurer A.

Publication year: 2021

Title of series: Leibniz International Proceedings in Informatics, LIPIcs

Volume number: 184

URL: https://www.scopus.com/inward/record.uri?eid=2-s2.0-85101720547&doi=10.4230%2fLIPIcs.OPODIS.2020.27&partnerID=40&md5=73360c703b13385ef18f65d2789164fd

Languages: English (EN-GB)


View on publisher site


Abstract

We consider the problem of communicating reliably in a dynamic network in the presence of up to k Byzantine failures. It was shown that this problem can be solved if and only if the dynamic graph satisfies a certain condition, that we call "RDC condition". In this paper, we present the first self-stabilizing algorithm for reliable communication in this setting - that is: in addition to permanent Byzantine failures, there can also be an arbitrary number of transient failures. We prove the correctness of this algorithm, provided that the RDC condition is "always eventually satisfied". © Alexandre Maurer; licensed under Creative Commons License CC-BY 24th International Conference on Principles of Distributed Systems (OPODIS 2020).


Keywords

No matching items found.


Documents

No matching items found.


Last updated on 2021-23-11 at 23:16