License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.OPODIS.2020.27
URN: urn:nbn:de:0030-drops-135126
Go to the corresponding LIPIcs Volume Portal

Maurer, Alexandre

Self-Stabilizing Byzantine-Resilient Communication in Dynamic Networks

LIPIcs-OPODIS-2020-27.pdf (0.4 MB)


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".

BibTeX - Entry

  author =	{Alexandre Maurer},
  title =	{{Self-Stabilizing Byzantine-Resilient Communication in Dynamic Networks}},
  booktitle =	{24th International Conference on Principles of Distributed Systems (OPODIS 2020)},
  pages =	{27:1--27:11},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-176-4},
  ISSN =	{1868-8969},
  year =	{2021},
  volume =	{184},
  editor =	{Quentin Bramas and Rotem Oshman and Paolo Romano},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{},
  URN =		{urn:nbn:de:0030-drops-135126},
  doi =		{10.4230/LIPIcs.OPODIS.2020.27},
  annote =	{Keywords: Dynamic networks, Self-stabilization, Byzantine failures}

Keywords: Dynamic networks, Self-stabilization, Byzantine failures
Collection: 24th International Conference on Principles of Distributed Systems (OPODIS 2020)
Issue Date: 2021
Date of publication: 25.01.2021

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI