Communication Complexity of Byzantine Agreement, Revisited
From MaRDI portal
Publication:5145228
DOI10.1145/3293611.3331629OpenAlexW2962882087WikidataQ130963123 ScholiaQ130963123MaRDI QIDQ5145228FDOQ5145228
Rafael Pass, T.-H. Hubert Chan, Kartik Nayak, Ling Ren, Ittai Abraham, Elaine Shi, Danny Dolev
Publication date: 20 January 2021
Published in: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1805.03391
Cited In (31)
- Title not available (Why is that?)
- Efficient adaptively-secure Byzantine agreement for long messages
- Rounds in Communication Complexity Revisited
- Title not available (Why is that?)
- Player-replaceability and forensic support are two sides of the same (crypto) coin
- 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
- On the round complexity of randomized Byzantine agreement
- State machine replication under changing network conditions
- Jolteon and Ditto: network-adaptive efficient consensus with asynchronous fallback
- 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
- 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
- Sublinear-round Byzantine agreement under corrupt majority
- Early stopping for any number of corruptions
- Sublinear message bounds of authenticated implicit Byzantine agreement
- Scalable and secure computation among strangers: message-competitive Byzantine protocols
- Formalizing delayed adaptive corruptions and the security of flooding networks
- Round efficient Byzantine agreement from VDFs
- Scalable agreement protocols with optimal optimistic efficiency
- Not a COINcidence: sub-quadratic asynchronous Byzantine agreement WHP
- On the adaptive security of MACs and PRFs
- Gossiping for communication-efficient broadcast
- How Byzantine is a send corruption?
- Fault-tolerant graph realizations in the congested clique
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)
