  We revisit Byzantine tolerant reliable broadcast with honest dealer
algorithms in multi-hop networks. To tolerate Byzantine faulty nodes
arbitrarily spread over the network, previous solutions require a factorial
number of messages to be sent over the network if the messages are not
authenticated (e.g. digital signatures are not available). We propose
modifications that preserve the safety and liveness properties of the original
unauthenticated protocols, while highly decreasing their observed message
complexity when simulated on several classes of graph topologies, potentially
opening to their employment.
