On the Amortized Communication Complexity of Byzantine Broadcast

ePrint Report: On the Amortized Communication Complexity of Byzantine Broadcast

Atsuki Momose, Ling Ren, Elaine Shi, Jun Wan, Zhuolun Xiang

Designing an efficient solution for Byzantine broadcast is an important problem for many distributed computing and cryptographic tasks. There have been many attempts to achieve sub-quadratic communication complexity in several directions, both in theory and practice, all with pros and cons. This paper initiates the study of another attempt: improving the amortized communication complexity of multi-shot Byzantine broadcast. Namely, we …

communication complexity computing cons distributed distributed computing eprint report important practice problem report shi solution study theory wan