Good-case early-stopping latency of synchronous Byzantine reliable broadcast: the deterministic case
From MaRDI portal
Publication:6579853
DOI10.1007/S00446-024-00464-6MaRDI QIDQ6579853FDOQ6579853
Authors: Timothé Albouy, Davide Frey, Michel Raynal, François Taïani 
Publication date: 26 July 2024
Published in: Distributed Computing (Search for Journal in Brave)
deterministic algorithmgenericitysynchronous systemreliable broadcastByzantine faultgood-case latencyweighted predicate
Cites Work
- Title not available (Why is that?)
- Authenticated Algorithms for Byzantine Agreement
- Early stopping in Byzantine agreement
- Reaching Agreement in the Presence of Faults
- The Byzantine Generals Problem
- Introduction to Reliable and Secure Distributed Programming
- Asynchronous byzantine agreement protocols
- Fault-Tolerant Message-Passing Distributed Systems
- Ein Satz über Untermengen einer endlichen Menge.
- Expected constant round Byzantine broadcast under dishonest majority
- Byzantine-tolerant causal broadcast
- Trading off t-Resilience for Efficiency in Asynchronous Byzantine Reliable Broadcast
- Round-efficient Byzantine broadcast under strongly adaptive and majority corruptions
- Algorand: a secure and efficient distributed ledger
- PoW-Based Distributed Cryptography with No Trusted Setup
- On the Number of Synchronous Rounds Sufficient for Authenticated Byzantine Agreement
- Communication Complexity of Byzantine Agreement, Revisited
- The consensus number of a cryptocurrency
- Signature-free asynchronous byzantine consensus with t < n/3 and o(n 2 ) messages
- Improved extension protocols for Byzantine broadcast and agreement
- Title not available (Why is that?)
- Good-case Latency of Byzantine 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)
