信息论HotStuff

摘要：

这项工作提出了信息理论的HotStuff（IT-HS），一个新的最佳弹性协议解决拜占庭协议的部分同步与信息理论的安全保证。特别是，IT-HS不依赖于任何PKI或常见设置假设，并且对计算上无限的对手具有弹性。IT-HS基于主备份视图模式。在IT-HS中，在每个视图中以及在每个视图改变中，每一方仅向每一其他方发送恒定数量的单词。这将在每个视图中生成一个$O(n^2)$字和消息复杂性。此外，IT-HS只需要$O(1)$持久本地存储和$O(n)$临时本地存储。最后，像部分同步中的所有基于主备份视图的协议一样，在系统同步之后，所有无故障方在第一视图中决定一个值，选择无故障的领导者。此外，与PBFT和HotStuff一样，IT-HS的响应也很乐观：在没有错误的领导者的情况下，各方会在网络允许的范围内尽快做出决定，而不考虑已知的网络延迟上限。我们的工作在多个维度上改进了Miguel Castro提出的PBFT的信息论版本，并且可以被视为HotStuff范式的信息论变体。

英文摘要：

This work presents Information Theoretic HotStuff (IT-HS), a new optimally resilient protocol for solving Byzantine Agreement in partial synchrony with information theoretic security guarantees. In particular, IT-HS does not depend on any PKI or common setup assumptions and is resilient to computationally unbounded adversaries. IT-HS is based on the Primary-Backup view-based paradigm. In IT-HS, in each view, and in each view change, each party sends only a constant number of words to every other party. This yields an $O(n^2)$ word and message complexity in each view. In addition, IT-HS requires just $O(1)$ persistent local storage and $O(n)$ transient local storage. Finally, like all Primary-Backup view-based protocols in partial synchrony, after the system becomes synchronous, all nonfaulty parties decide on a value in the first view a nonfaulty leader is chosen. Moreover, like PBFT and HotStuff, IT-HS is optimistically responsive: with a nonfaulty leader, parties decide as quickly as the network allows them to do so, without regard for the known upper bound on network delay. Our work improves in multiple dimensions upon the information theoretic version of PBFT presented by Miguel Castro, and can be seen as an information theoretic variant of the HotStuff paradigm.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。