Practical Byzantine Reliable Broadcast on Partially Connected Networks

Bonomi, Silvia; Decouchant, Jérémie; Farina, Giovanni; Rahli, Vincent; Tixeuil, Sébastien

doi:10.1109/icdcs51616.2021.00055

Cited by 8 publications

(6 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Multicast queries to these copies and waiting for their responses will be possible. Node information has been updated, and the network's current number of active nodes is known after running NDC protocols [26][27] [28].…”

Section: A Reply From the Customermentioning

confidence: 99%

Dynamic Protocol Blockchain for Practical Byzantine Fault Tolerance Consensus

Sarfraz,

Ye,

Zhao

et al. 2023

International Journal of Scientific Advances

View full text Add to dashboard Cite

This work details the byzantine fault-tolerant protocols that dynamically allow replicas to join and exit. Byzantine fault-tolerant (BFT) protocols and the blockchain now play an essential role in achieving consensus. There are numerous drawbacks to PBFT, despite its multiple positives. The first thing to note is that it runs in an environment completely isolated from the rest of the world. The entire system must be shut down before any nodes can be added or removed. Second, it ensures liveness and safety if no more than (n-1)/3 out of total n replicas, PBFT takes no action to cope with ineffective or malicious counterparts. This is bad for the system and will lead to its eventual failure. These flaws have far-reaching consequences in real life. The Randomization PBFT is an alternative way of dealing with these issues. In recent decades, as computer technology has advanced, so has our reliance on the products, services, and capabilities that computers provide.

show abstract

Section: A Reply From the Customermentioning

confidence: 99%

Dynamic Protocol Blockchain for Practical Byzantine Fault Tolerance Consensus

Sarfraz,

Ye,

Zhao

et al. 2023

International Journal of Scientific Advances

View full text Add to dashboard Cite

show abstract

“…In the context of Reliable Broadcast, there are (non-self-stabilizing) Byzantine fault-tolerant (BFT) solutions [1,13,14] and (non-BFT) self-stabilizing solutions [15] (even for total order broadcast [15][16][17][18]). We focus on BT [4,5] to which we propose a self-stabilizing variation.…”

Section: Related Workmentioning

confidence: 99%

Self-stabilizing Byzantine Fault-Tolerant Repeated Reliable Broadcast

Duvignau

Raynal

Schiller

2022

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Consensus, abstracting a myriad of problems in which processes have to agree on a single value, is one of the most celebrated problems of fault-tolerant distributed computing. Consensus applications include fundamental services for the environments of the Cloud and Blockchain, and in such challenging environments, malicious behaviors are often modeled as adversarial Byzantine faults.At OPODIS 2010, Mostéfaoui and Raynal (in short MR) presented a Byzantinetolerant solution to consensus in which the decided value cannot be a value proposed only by Byzantine processes. MR has optimal resilience coping with up to t < n/3 Byzantine nodes over n processes. MR provides this multivalued consensus object (which accepts proposals taken from a finite set 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 self-stabilization, a vigorous notion of fault-tolerance. In addition to tolerating Byzantine, 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).To the best of our knowledge, we propose the first self-stabilizing solution for intrusion-tolerant multivalued consensus for asynchronous message-passing systems prone to Byzantine failures. Our solution has a O(t) stabilization time from arbitrary transient faults.

show abstract

“…Signatures provide us with a network-wide non-repudiation mechanism: if a Byzantine process issues two conflicting imp-messages to two different subsets of correct processes, then the correct processes can detect the malicious behavior by disclosing to each other the Byzantine signed imp-messages. 6…”

Section: Message Adversarymentioning

confidence: 99%

“…when BUNDLE(m, sn, j, sigs) is received do (3) if (−, sn, j) not already mbrb-delivered ∧ sigs contains the valid signature for (m, sn, j) by pj then (4) save all unsaved valid signatures for (m, sn, j) of sigs; (5) if (−, sn, j) not already signed by pi then (6) save signature for (m, sn, j) by pi; (7) broadcast BUNDLE(m, sn, j, {all saved signatures for (m, sn, j)}) (8) end if; (9) if strictly more than n+t 2 signatures for (m, sn, j) are saved then (10) broadcast BUNDLE(m, sn, j, {all saved signatures for (m, sn, j)}); (11) mbrb_deliver(m, sn, j) (12) end if (13) end if.…”

Section: Algorithmmentioning

confidence: 99%

See 1 more Smart Citation

Asynchronous Byzantine Reliable Broadcast With a Message Adversary

Albouy¹,

Frey²,

Raynal³

et al. 2022

Preprint

View full text Add to dashboard Cite

This paper considers the problem of reliable broadcast in asynchronous authenticated systems, in which n processes communicate using signed messages and up to t processes may behave arbitrarily (Byzantine processes). In addition, for each message m broadcast by a correct (i.e., non-Byzantine) process, a message adversary may prevent up to d correct processes from receiving m. (This message adversary captures network failures such as transient disconnections, silent churn, or message losses.) Considering such a "double" adversarial context and assuming n > 3t + 2d, a reliable broadcast algorithm is presented. Interestingly, when there is no message adversary (i.e., d = 0), the algorithm terminates in two communication steps (so, in this case, this algorithm is optimal in terms of both Byzantine tolerance and time efficiency). It is then shown that the condition n > 3t + 2d is necessary for implementing reliable broadcast in the presence of both Byzantine processes and a message adversary (whether the underlying system is enriched with signatures or not).

show abstract

Practical Byzantine Reliable Broadcast on Partially Connected Networks

Cited by 8 publications

References 24 publications

Dynamic Protocol Blockchain for Practical Byzantine Fault Tolerance Consensus

Dynamic Protocol Blockchain for Practical Byzantine Fault Tolerance Consensus

Self-stabilizing Byzantine Fault-Tolerant Repeated Reliable Broadcast

Asynchronous Byzantine Reliable Broadcast With a Message Adversary

Contact Info

Product

Resources

About