On the versatility of Bracha's Byzantine reliable broadcast algorithm
From MaRDI portal
(Redirected from Publication:5087090)
Recommendations
- Byzantine-Tolerant Reliable Broadcast in the Presence of Silent Churn
- Trading off t-resilience for efficiency in asynchronous Byzantine reliable broadcast
- Are Byzantine failures really different from crash failures?
- Signature-free asynchronous binary Byzantine consensus with \(t<n/3\), \(O(n^2)\) messages, and \(O(1)\) expected time
- FAST BROADCASTING WITH BYZANTINE FAULTS
Cites work
- Asynchronous byzantine agreement protocols
- Asynchronous consensus and broadcast protocols
- Fault-tolerant message-passing distributed systems. An algorithmic approach
- Reaching Agreement in the Presence of Faults
- Scalable Byzantine reliable broadcast
- The Byzantine Generals Problem
- Trading off t-resilience for efficiency in asynchronous Byzantine reliable broadcast
Cited in
(8)- Round-efficient Byzantine broadcast under strongly adaptive and majority corruptions
- Broadcast using certified propagation algorithm in presence of Byzantine faults
- Trading off t-resilience for efficiency in asynchronous Byzantine reliable broadcast
- Expressive Power of Broadcast Consensus Protocols
- Asynchronous Byzantine reliable broadcast with a message adversary
- Tame the Wild with Byzantine Linearizability: Reliable Broadcast, Snapshots, and Asset Transfer
- Byzantine-Tolerant Reliable Broadcast in the Presence of Silent Churn
- Byzantine reliable broadcast and tendermint consensus with trusted components
This page was built for publication: On the versatility of Bracha's Byzantine reliable broadcast algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5087090)
