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.

中文翻译：

---

诚实经销商的多跳拜占庭可靠广播变得实用

我们在多跳网络中使用诚实的经销商算法重新审视拜占庭容忍的可靠广播。为了容忍在网络上任意散布的拜占庭故障节点，如果消息未通过身份验证（例如，数字签名不可用），先前的解决方案需要通过网络发送阶乘数量的消息。我们提出了一些修改，以保留原始未经身份验证协议的安全性和活性属性，​​同时在几类图拓扑上模拟时大大降低了它们观察到的消息复杂性，从而可能对其使用开放。