Scalable Byzantine reliable broadcast

DOI10.4230/LIPICS.DISC.2019.22MaRDI QIDQ6487539zbMATH OpenFDO

Authors Rachid Guerraoui, Petr Kuznetsov, Matteo Monti, Matej Pavlovic, Dragos-Adrian Seredinschi

Publication date 3 February 2023

Full work available at URL https://doi.org/10.4230/LIPICS.DISC.2019.22

zbMATH Keywords

Byzantine reliable broadcastprobabilistic distributed algorithmsscalable distributed systemsstochastic processes

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Recommendations

• Self-stabilizing Byzantine fault-tolerant repeated reliable broadcast
• Self-stabilizing Byzantine fault-tolerant repeated reliable broadcast
• FAST BROADCASTING WITH BYZANTINE FAULTS
• Byzantine-tolerant causal broadcast
• Reliable Broadcasting in Logarithmic Time with Byzantine Link Failures
• Reliable broadcast in dynamic networks with locally bounded Byzantine failures
• scientific article; zbMATH DE number 7650856
• Byzantine-Tolerant Reliable Broadcast in the Presence of Silent Churn
• Asynchronous Byzantine reliable broadcast with a message adversary

Cited in

(14)

• Scalable eventually consistent counters over unreliable networks
• Byzantine-tolerant causal broadcast
• Broadcast using certified propagation algorithm in presence of Byzantine faults
• HPP: A Reliable Causal Broadcast Protocol for Large-Scale Replication in Wide Area Networks
• On the versatility of Bracha's Byzantine reliable broadcast algorithm
• scientific article; zbMATH DE number 7650856 (Why is no real title available?)
• Asynchronous Byzantine reliable broadcast with a message adversary
• Tame the Wild with Byzantine Linearizability: Reliable Broadcast, Snapshots, and Asset Transfer
• Gossiping for communication-efficient broadcast
• Self-stabilizing Byzantine fault-tolerant repeated reliable broadcast
• Byzantine-Tolerant Reliable Broadcast in the Presence of Silent Churn
• Process-commutative distributed objects: from cryptocurrencies to Byzantine-fault-tolerant CRDTs
• Dynamic Byzantine reliable broadcast
• The fractional spending problem: executing payment transactions in parallel with less than f+1 validations

This page was built for publication: Scalable Byzantine reliable broadcast

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487539)