Efficient Byzantine Reliable Broadcast with Low Communication and Time Complexity

This paper introduces novel mechanisms to lower the communication and computational complexity of Byzantine reliable broadcast protocols in asynchronous networks with less than a third of Byzantine nodes. Two algorithms are presented that achieve an overhead factor of 2 and 3/2 respectively, while also optimizing the time complexity.