Communication Complexity of Byzantine Agreement, Revisited
From MaRDI portal
Publication:5145228
Recommendations
- Communication complexity of Byzantine agreement, revisited
- Optimally efficient multi-valued byzantine agreement
- Optimal communication complexity of authenticated Byzantine agreement
- Efficient adaptively-secure Byzantine agreement for long messages
- Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party
Cited in
(44)- Fault-tolerant graph realizations in the congested clique
- Adaptive security, erasures, and network assumptions in communication-local MPC
- scientific article; zbMATH DE number 6297761 (Why is no real title available?)
- Efficient adaptively-secure Byzantine agreement for long messages
- Rounds in Communication Complexity Revisited
- Nearly-optimal consensus tolerating adaptive omissions: why a lot of randomness is needed?
- All Byzantine agreement problems are expensive
- DARE to agree: Byzantine agreement with optimal resilience and adaptive communication
- scientific article; zbMATH DE number 7559107 (Why is no real title available?)
- Player-replaceability and forensic support are two sides of the same (crypto) coin
- On the round complexity of randomized Byzantine agreement
- Byzantine consensus is \(\Theta(n^2)\): the Dolev-Reischuk bound is tight even in partial synchrony!
- Good-case early-stopping latency of synchronous Byzantine reliable broadcast: the deterministic case
- Non-interactive anonymous router with quasi-linear router computation
- Communication lower bounds for cryptographic broadcast protocols
- State machine replication under changing network conditions
- Jolteon and Ditto: network-adaptive efficient consensus with asynchronous fallback
- Optimal communication complexity of authenticated Byzantine agreement
- Completeness theorems for adaptively secure broadcast
- Network-agnostic security comes (almost) for free in DKG and MPC
- Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party
- Transparent batchable time-lock puzzles and applications to Byzantine consensus
- Sublinear-round Byzantine agreement under corrupt majority
- Nearly optimal parallel broadcast in the plain public key model
- Leader election with poly-logarithmic communication per party
- Brief Announcement: Improved Consensus in Quantum Networks
- Deterministic Fault-Tolerant Distributed Computing in Linear Time and Communication
- On the Amortized Communication Complexity of Byzantine Broadcast
- On the Validity of Consensus
- Early stopping for any number of corruptions
- Distributed fast crash-tolerant consensus with nearly-linear quantum communication
- Sublinear message bounds of authenticated implicit Byzantine agreement
- Scalable and secure computation among strangers: message-competitive Byzantine protocols
- Asymptotically optimal early termination for dishonest majority broadcast
- Communication complexity of Byzantine agreement, revisited
- Formalizing delayed adaptive corruptions and the security of flooding networks
- Scalable distributed agreement from LWE: Byzantine agreement, broadcast, and leader election
- Round efficient Byzantine agreement from VDFs
- Scalable agreement protocols with optimal optimistic efficiency
- Expected constant round Byzantine broadcast under dishonest majority
- On the adaptive security of MACs and PRFs
- Not a COINcidence: sub-quadratic asynchronous Byzantine agreement WHP
- Gossiping for communication-efficient broadcast
- How Byzantine is a send corruption?
This page was built for publication: Communication Complexity of Byzantine Agreement, Revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145228)
