Simple and Efficient Reliable Broadcast in the Presence of Byzantine Processes

This paper presents a surprisingly simple and efficient reliable broadcast algorithm for asynchronous message-passing systems made up of $n$ processes, among which up to $t<n/3$ may behave arbitrarily (Byzantine processes). This algorithm requires two communication steps and $n^2$ messages. (The best algorithm known so far requires three communication steps and $2n^2$ messages.)