Self-stabilization of Byzantine Protocols

Daliot, Ariel; Dolev, Danny

doi:10.1007/11577327_4

Cited by 27 publications

(27 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We use the notation d ≡ δ + π. Thus, when the communication network is non-faulty, d is the upper bound on the elapsed real-time from the sending of a message by a non-faulty node until it is received and processed by every non-faulty node 4 . Note that n, f and d are fixed constants and thus nonfaulty nodes do not initialize with arbitrary values of these constants.…”

Section: The Sender's Identity and Content Of Any Message Being Receimentioning

confidence: 99%

“…Essentially, we assume that messages among correct nodes are delivered within the time bounds. 4 Nodes that were not faulty when the message was sent. 5 We assume ∆ net ≥ d. Hence, if the system is not coherent then there can be an unbounded number of concurrent faulty nodes; the turnover rate between the faulty and non-faulty nodes can be arbitrarily large and the communication network may deliver messages with unbounded delays, if at all.…”

Section: The Sender's Identity and Content Of Any Message Being Receimentioning

confidence: 99%

“…This difficulty may be indicated by the remarkably few algorithms resilient to both fault models (see [4] for a review). The few published selfstabilizing Byzantine algorithms are typically complicated and sometimes converge from an arbitrary initial state only after exponential or super exponential time ( [7]).…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Self-stabilizing byzantine agreement

Daliot

Dolev

2006

Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing

Self Cite

View full text Add to dashboard Cite

Byzantine agreement algorithms typically assume implicit initial state consistency and synchronization among the correct nodes and then operate in coordinated rounds of information exchange to reach agreement based on the input values. The implicit initial assumptions enable correct nodes to infer about the progression of the algorithm at other nodes from their local state. This paper considers a more severe fault model than permanent Byzantine failures, one in which the system can in addition be subject to severe transient failures that can temporarily throw the system out of its assumption boundaries. When the system eventually returns to behave according to the presumed assumptions it may be in an arbitrary state in which any synchronization among the nodes might be lost, and each node may be at an arbitrary state. We present a self-stabilizing Byzantine agreement algorithm that reaches agreement among the correct nodes in optimal time, by using only the assumption of bounded message transmission delay. In the process of solving the problem, two additional important and challenging building blocks were developed: a unique self-stabilizing protocol for assigning consistent relative times to protocol initialization and a Reliable Broadcast primitive that progresses at the speed of actual message delivery time.

show abstract

Section: The Sender's Identity and Content Of Any Message Being Receimentioning

confidence: 99%

Section: The Sender's Identity and Content Of Any Message Being Receimentioning

confidence: 99%

See 1 more Smart Citation

Self-stabilizing byzantine agreement

Daliot

Dolev

2006

Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing

Self Cite

View full text Add to dashboard Cite

show abstract

“…However, a self-stabilizing system can be disturbed by Byzantine processes after reaching a c-legitimate and c-stable configuration. The c-disruption represents the period where c-correct processes are disturbed by Byzantine processes and is defined as follows 3. ρ 0 is c-legitimate for spec and c-stable, and 4. ρ t is the first configuration after ρ 0 such that ρ t is c-legitimate for spec and c-stable.…”

Section: Definition 1 (C-correct Process)mentioning

confidence: 99%

“…Self-stabilization [4,6,15] is a versatile technique that permits forward recovery from any kind of transient faults, while Byzantine Fault-tolerance [10] is traditionally used to mask the effect of a limited number of malicious faults. Making distributed systems tolerant to both transient and malicious faults is appealing yet proved difficult [7,3,13] as impossibility results are expected in many cases.…”

Section: Introductionmentioning

confidence: 99%

Bounding the Impact of Unbounded Attacks in Stabilization

Masuzawa

Tixeuil

2006

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Self-stabilization is a versatile approach to fault-tolerance since it permits a distributed system to recover from any transient fault that arbitrarily corrupts the contents of all memories in the system. Byzantine tolerance is an attractive feature of distributed systems that permits to cope with arbitrary malicious behaviors. Combining these two properties proved difficult: it is impossible to contain the spatial impact of Byzantine nodes in a self-stabilizing context for global tasks such as tree orientation and tree construction.We present and illustrate a new concept of Byzantine containment in stabilization. Our property, called Strong Stabilization enables to contain the impact of Byzantine nodes if they actually perform too many Byzantine actions. We derive impossibility results for strong stabilization and present strongly stabilizing protocols for tree orientation and tree construction that are optimal with respect to the number of Byzantine nodes that can be tolerated in a self-stabilizing context.

show abstract

Self-Stabilizing Pulse Synchronization Inspired by Biological Pacemaker Networks

Daliot

Dolev

Parnas

2003

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

We define the "Pulse Synchronization" problem that requires nodes to achieve tight synchronization of regular pulse events, in the settings of distributed computing systems. Pulse-coupled synchronization is a phenomenon displayed by a large variety of biological systems, typically overcoming a high level of noise. Inspired by such biological models, a robust and selfstabilizing Byzantine pulse synchronization algorithm for distributed computer systems is presented. The algorithm attains near optimal synchronization tightness while tolerating up to a third of the nodes exhibiting Byzantine behavior concurrently. Pulse synchronization has been previously shown to be a powerful building block for designing algorithms in this severe fault model. We have previously shown how to stabilize general Byzantine algorithms, using pulse synchronization. To the best of our knowledge there is no other scheme to do this without the use of synchronized pulses.

show abstract

Self-stabilization of Byzantine Protocols

Abstract: Abstract. Awareness of the need for robustness in distributed systems increases as distributed systems become integral parts of day-to-day systems. Self-stabilizing while tolerating ongoing Byzantine faults are wishful properties of a distributed system. Many distributed tasks (e.g.

Cited by 27 publications

References 22 publications

Self-stabilizing byzantine agreement

Self-stabilizing byzantine agreement

Bounding the Impact of Unbounded Attacks in Stabilization

Self-Stabilizing Pulse Synchronization Inspired by Biological Pacemaker Networks

Contact Info

Product

Resources

About