On the Amortized Communication Complexity of Byzantine Broadcast
From MaRDI portal
Publication:6202258
DOI10.1145/3583668.3594596MaRDI QIDQ6202258FDOQ6202258
Authors: Jun Wan, Ling Ren, Elaine Shi, Zhuolun Xiang 
Publication date: 26 March 2024
Published in: Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Authenticated Algorithms for Byzantine Agreement
- Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
- Secure distributed key generation for discrete-log based cryptosystems
- Introduction to Reliable and Secure Distributed Programming
- Scalable and Unconditionally Secure Multiparty Computation
- Error-free multi-valued consensus with Byzantine failures
- Bounds on information exchange for Byzantine agreement
- Perfectly-Secure MPC with Linear Communication Complexity
- Atomic broadcast: From simple message diffusion to Byzantine agreement
- Expected constant round Byzantine broadcast under dishonest majority
- Asynchronous Byzantine agreement with subquadratic communication
- Round-optimal Byzantine agreement
- Communication Complexity of Byzantine Agreement, Revisited
- HotStuff
- Breaking the \(O(n^2)\) bit barrier, scalable Byzantine agreement with an adaptive adversary
- Robust Multiparty Computation with Linear Communication Complexity
- Broadcast Extensions with Optimal Communication and Round Complexity
- Automata, Languages and Programming
This page was built for publication: On the Amortized Communication Complexity of Byzantine Broadcast
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6202258)
