论文标题
改进了拜占庭广播和协议的扩展协议
Improved Extension Protocols for Byzantine Broadcast and Agreement
论文作者
论文摘要
拜占庭广播（BB）和拜占庭协议（BA）是两个最根本的问题，是分布式计算中的基本基础，而提高其效率是理论家和从业者都感兴趣的。在本文中，我们研究了BB和BA的扩展协议，即使用低于$ l $单位实例的成本较低的$ L $位的BB/BA的协议。我们介绍了几乎所有设置中具有改进的通信复杂性的新协议：$ t <n/2 $的身份验证的ba/bb，具有$ t <（1-ε）n $的身份验证的bb，未经身份验证的ba/bb，带有$ t <n/3 $，以及异常可靠的可靠的广播和ba，带有$ t <n/t <n/3 $。新协议在几个方面都是有利的，而且很重要。首先，与先前的结果相比，它们实现了更宽的输入范围的$θ（NL）$的最佳沟通复杂性。其次，鉴于当前最佳可用BB/BA协议用于简短消息，身份验证的扩展协议达到了最佳通信复杂性。第三，据我们所知，设置中的异步和身份验证的协议是该设置中的第一个扩展协议。
Byzantine broadcast (BB) and Byzantine agreement (BA) are two most fundamental problems and essential building blocks in distributed computing, and improving their efficiency is of interest to both theoreticians and practitioners. In this paper, we study extension protocols of BB and BA, i.e., protocols that solve BB/BA with long inputs of $l$ bits using lower costs than $l$ single-bit instances. We present new protocols with improved communication complexity in almost all settings: authenticated BA/BB with $t<n/2$, authenticated BB with $t<(1-ε)n$, unauthenticated BA/BB with $t<n/3$, and asynchronous reliable broadcast and BA with $t<n/3$. The new protocols are advantageous and significant in several aspects. First, they achieve the best-possible communication complexity of $Θ(nl)$ for wider ranges of input sizes compared to prior results. Second, the authenticated extension protocols achieve optimal communication complexity given the current best available BB/BA protocols for short messages. Third, to the best of our knowledge, our asynchronous and authenticated protocols in the setting are the first extension protocols in that setting.
