论文标题
信息理论热门
Information Theoretic 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.
