Good-case early-stopping latency of synchronous Byzantine reliable broadcast: the deterministic case
From MaRDI portal
Publication:6579853
Cites work
- scientific article; zbMATH DE number 2081084 (Why is no real title available?)
- Algorand: a secure and efficient distributed ledger
- Asynchronous byzantine agreement protocols
- Authenticated Algorithms for Byzantine Agreement
- Byzantine-tolerant causal broadcast
- Communication Complexity of Byzantine Agreement, Revisited
- Early stopping in Byzantine agreement
- Ein Satz über Untermengen einer endlichen Menge.
- Expected constant round Byzantine broadcast under dishonest majority
- Fault-tolerant message-passing distributed systems. An algorithmic approach
- Good-case Latency of Byzantine Broadcast
- Improved extension protocols for Byzantine broadcast and agreement
- Introduction to Reliable and Secure Distributed Programming
- Money transfer made simple: a specification, a generic algorithm, and its proof
- On the Number of Synchronous Rounds Sufficient for Authenticated Byzantine Agreement
- PoW-based distributed cryptography with no trusted setup
- Reaching Agreement in the Presence of Faults
- Round-efficient Byzantine broadcast under strongly adaptive and majority corruptions
- Signature-free asynchronous byzantine consensus with t < n/3 and o(n 2 ) messages
- The Byzantine Generals Problem
- The consensus number of a cryptocurrency
- Trading off \(t\)-resilience for efficiency in asynchronous Byzantine reliable broadcast
This page was built for publication: Good-case early-stopping latency of synchronous Byzantine reliable broadcast: the deterministic case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6579853)
