论文标题
异步拜占庭可靠的广播，带有消息对手
Asynchronous Byzantine Reliable Broadcast With a Message Adversary
论文作者
论文摘要
本文考虑了在异步身份验证的系统中可靠广播的问题，在该系统中，n过程使用签名的消息进行通信，并且最大的t过程可能会任意行为（拜占庭式流程）。此外，对于通过正确（即非byzantine）过程广播的每条消息M，消息对手可能会阻止d正确的过程接收m。 （此消息对手捕获网络故障，例如瞬态断开连接，无声流失或消息丢失。）考虑到这种“双重”对抗上下文，并假设n> 3T + 2D，则会提出可靠的广播算法。有趣的是，当没有消息对手（即d = 0）时，该算法将以两个通信步骤终止（因此，在这种情况下，此算法在拜占庭公差和时间效率方面都是最佳的。然后，证明条件n> 3t + 2d对于在拜占庭流程的存在和消息对手的存在下实现可靠的广播是必要的（无论是基础系统是否富含签名）。
This paper considers the problem of reliable broadcast in asynchronous authenticated systems, in which n processes communicate using signed messages and up to t processes may behave arbitrarily (Byzantine processes). In addition, for each message m broadcast by a correct (i.e., non-Byzantine) process, a message adversary may prevent up to d correct processes from receiving m. (This message adversary captures network failures such as transient disconnections, silent churn, or message losses.) Considering such a "double" adversarial context and assuming n > 3t + 2d, a reliable broadcast algorithm is presented. Interestingly, when there is no message adversary (i.e., d = 0), the algorithm terminates in two communication steps (so, in this case, this algorithm is optimal in terms of both Byzantine tolerance and time efficiency). It is then shown that the condition n > 3t + 2d is necessary for implementing reliable broadcast in the presence of both Byzantine processes and a message adversary (whether the underlying system is enriched with signatures or not).
