Brief Announcement: Optimal Self-stabilizing Mobile Byzantine-Tolerant Regular Register with Bounded Timestamps

Bonomi, Silvia; Pozzo, Antonella Del; Potop-Butucaru, Maria; Tixeuil, Sébastien

doi:10.1007/978-3-030-03232-6_28

Cited by 10 publications

(10 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our work paves the way toward deeper analyzes about reliable communication and others related distributed system problems with mobile Byzantine faults in multi-hop networks. A particularly interesting question is the feasability of tolerating both mobile Byzantine failures and self-stabilization (as in the register construction of Bonomi et al [6]) for the purpose of reliable communication. To our knowledge, this problem was only shown solvable by Maurer et al [14] for the static Byzantine case.…”

Section: Discussionmentioning

confidence: 99%

Broadcasting Information in Multi-hop Networks Prone to Mobile Byzantine Faults

2021

Self Cite

View full text Add to dashboard Cite

Every non-trivial distributed application needs to exchange information in order accomplish its task, and reliable communication primitives are fundamental in failures prone distributed systems to guarantee correct message exchanges between parties. Their implementation becomes particularly challenging when considering distributed systems where processes are arranged in a multi-hop network and each of them may temporary and continuously be compromised by an attacker during the execution. Although some fundamental problems (such as the register implementation and the agreement) were investigated considering Mobile Byzantine Faults (MBF), most of the contributions consider a fully connected communication network. In this paper we analyze the specific difficulty of ensuring reliable communication between parties in a distributed system affected by Mobile Byzantine Faults (compared to the case where the Byzantine failures are static), showing that such a problem is essentially impossible to solve in asynchronous systems with MBF, and we propose a synchronous protocol providing reliable communication both in complete networks and specific multi-hop topologies.

show abstract

Section: Discussionmentioning

confidence: 99%

Broadcasting Information in Multi-hop Networks Prone to Mobile Byzantine Faults

2021

Self Cite

View full text Add to dashboard Cite

show abstract

“…In the broader context of self-stabilizing Byzantine-tolerant solutions for message-passing systems, we find solutions for topology discovery [18], storage [11,10,9,8,7], clock synchronization [20,27,25], approximate agreement [12], asynchronous unison [23] to name a few. Also, Byzantine-tolerant state-machine replication by Binun et al [4,5] for synchronous systems and Dolev et al [16] for practically-self-stabilizing partially-synchronous systems.…”

Section: Related Workmentioning

confidence: 99%

Self-stabilizing Byzantine-tolerant Broadcast

Duvignau¹,

Raynal²,

Schiller³

2022

Preprint

View full text Add to dashboard Cite

We study a well-known communication abstraction called Byzantine Reliable Broadcast (BRB). This abstraction is central in the design and implementation of fault-tolerant distributed systems, as many fault-tolerant distributed applications require communication with provable guarantees on message deliveries. Our study focuses on fault-tolerant implementations for message-passing systems that are prone to process-failures, such as crashes and malicious behavior.At PODC 1983, Bracha and Toueg, in short, BT, solved the BRB problem. BT has optimal resilience since it can deal with t < n/3 Byzantine processes, where n is the number of processes. The present work aims at the design of an even more robust solution than BT by expanding its fault-model with self-stabilization, a vigorous notion of fault-tolerance. In addition to tolerating Byzantine and communication failures, self-stabilizing systems can recover after the occurrence of arbitrary transient-faults. These faults represent any violation of the assumptions according to which the system was designed to operate (provided that the algorithm code remains intact).We propose, to the best of our knowledge, the first self-stabilizing Byzantinetolerant BRB solution for signature-free message-passing systems. Our contribution includes a self-stabilizing variation on a BT that solves a single-round BRB for asynchronous systems. We also consider the problem of recycling instances of singleround BRB. Our self-stabilizing Byzantine-tolerant recycling for time-free systems facilitates the concurrent handling of a predefined number of BRB invocations. Our proposal can serve as the basis for self-stabilizing Byzantine-tolerant consensus.

show abstract

“…Georgiou et al's solution can be used as the selfstabilizing Byzantine-tolerant Binary consensus object needed for our solution. In the broader context of self-stabilizing Byzantine-tolerant solutions for message-passing systems, we find solutions for topology discovery [22], storage [11,10,9,8,7], clock synchronization [24,31,29], approximate agreement [12], asynchronous unison [25] to name a few. Also, Byzantine-tolerant state-machine replication by Binun et al [4,5] for synchronous systems and Dolev et al [20] for practically-self-stabilizing partially-synchronous systems.…”

Section: Related Workmentioning

confidence: 99%

Self-stabilizing Byzantine- and Intrusion-tolerant Consensus

Duvignau¹,

Raynal²,

Schiller³

2021

Preprint

View full text Add to dashboard Cite

One of the most celebrated problems of fault-tolerant distributed computing is the consensus problem. It was shown to abstract a myriad of problems in which processes have to agree on a single value. Consensus applications include fundamental services for the environments of the Cloud or Blockchain. In such challenging environments, malicious behavior is often modeled as adversarial Byzantine faults. At OPODIS 2010, Mostéfaoui and Raynal, in short, MR, presented a Byzantine-and intrusiontolerant solution to consensus in which the decided value cannot be a value proposed only by Byzantine processes. In addition to this validity property, MR has optimal resilience since it can deal with up to t < n/3 Byzantine processes, where n is the number of processes. We note that MR provides this multivalued consensus object (which accepts proposals taken from a set with a finite number of values) assuming the availability of a single Binary consensus object (which accepts proposals taken from the set {0, 1}).This work, which focuses on multivalued consensus, aims at the design of an even more robust solution than MR. Our proposal expands MR's fault-model with selfstabilization, a vigorous notion of fault-tolerance. In addition to tolerating Byzantine and communication failures, self-stabilizing systems can automatically recover after the occurrence of arbitrary transient-faults. These faults represent any violation of the assumptions according to which the system was designed to operate (provided that the algorithm code remains intact). We propose, to the best of our knowledge, the first self-stabilizing solution for intrusion-tolerant multivalued consensus for asynchronous message-passing systems prone to Byzantine failures.

show abstract

Brief Announcement: Optimal Self-stabilizing Mobile Byzantine-Tolerant Regular Register with Bounded Timestamps

Cited by 10 publications

References 32 publications

Broadcasting Information in Multi-hop Networks Prone to Mobile Byzantine Faults

Broadcasting Information in Multi-hop Networks Prone to Mobile Byzantine Faults

Self-stabilizing Byzantine-tolerant Broadcast

Self-stabilizing Byzantine- and Intrusion-tolerant Consensus

Contact Info

Product

Resources

About