2026-07-22T15:57:10Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:13512 2024-03-06T10:52:14Z ddc:004 open_access

Self-Stabilizing Byzantine-Resilient Communication in Dynamic Networks Maurer, Alexandre Dynamic networks Self-stabilization Byzantine failures 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". Schloss Dagstuhl – Leibniz-Zentrum für Informatik Alexandre Maurer 2021 Is Part Of LIPIcs, Volume 184, 24th International Conference on Principles of Distributed Systems (OPODIS 2020) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.OPODIS.2020.27 urn:nbn:de:0030-drops-135126 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2020.27 eng https://creativecommons.org/licenses/by/3.0/legalcode