Round-efficient Byzantine broadcast under strongly adaptive and majority corruptions
From MaRDI portal
(Redirected from Publication:2055729)
Recommendations
- Asynchronous Byzantine reliable broadcast with a message adversary
- On the versatility of Bracha's Byzantine reliable broadcast algorithm
- Round-optimal Byzantine agreement
- Boosting the Efficiency of Byzantine-Tolerant Reliable Communication
- Expected constant round Byzantine broadcast under dishonest majority
- On Byzantine broadcast in loosely connected networks
- Broadcast using certified propagation algorithm in presence of Byzantine faults
- A new parameter for a broadcast algorithm with locally bounded Byzantine faults
Cited in
(12)- Good-case early-stopping latency of synchronous Byzantine reliable broadcast: the deterministic case
- Concurrent asynchronous Byzantine agreement in expected-constant rounds, revisited
- Expected constant round Byzantine broadcast under dishonest majority
- Completeness theorems for adaptively secure broadcast
- Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party
- Transparent batchable time-lock puzzles and applications to Byzantine consensus
- Round-optimal Byzantine agreement
- Time-lock puzzles with efficient batch solving
- Early stopping for any number of corruptions
- Time-lock puzzles from lattices
- Round efficient Byzantine agreement from VDFs
- How Byzantine is a send corruption?
This page was built for publication: Round-efficient Byzantine broadcast under strongly adaptive and majority corruptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2055729)
