With the rapid development of blockchain, Byzantine fault-tolerant protocols have attracted revived interest recently. To overcome the theoretical bounds of Byzantine fault tolerance, many protocols attempt to use Trusted Execution Environment (TEE) to prevent equivocation and improve performance and scalability. However, due to the broken quorum intersection assumption caused by the reduction of the replica number, the improvement is mostly at the cost of increased communication complexity which prevents existing TEE-based protocols to be applied to large-scale blockchain systems. In this paper, we propose TBFT, an efficient Byzantine fault-tolerant protocol in the partial synchrony setting, which has O(n) message complexity in both normal-case and view-change. Compared to previous protocols, TBFT uses TEE-assisted primitives to limit more types of malicious behaviors of replicas rather than preventing equivocation only, thereby reducing the latency and communication complexity of clients and replicas. Besides, we also introduce lightweight cryptographic primitives including a novel leader election mechanism and an efficient voting message aggregation mechanism for better security and performance. We evaluate TBFT via systematic analysis and experiments, and the results show that TBFT has better performance and scalability compared to other protocols.
翻译:拜占庭防过错协议最近重新引起了人们的兴趣。为了克服拜占庭防错的理论界限,许多协议试图利用信任执行环境(TEE)防止不均,改进性能和可缩放性。然而,由于复制数量减少造成法定人数交叉假设中断,因此,改进的代价主要是通信复杂性增加,使现有的基于TEE的协议无法适用于大型供应链系统。在本文件中,我们提议TBFT(TBFT),这是部分同步环境下高效的Byzantine防错协议,在正常情况下和观点变化中都具有O(n)信息复杂性。与以前的协议相比,TBFT(T)FT(T)利用TE)协助的原始技术来限制更多种类的复制品恶意行为,而不是仅仅防止静默,从而降低客户和复制品的惯用和通信复杂性。此外,我们还引入了轻量的加密原始材料,包括一个新的领导人选举机制,以及高效的投票信息汇总机制,以便改进安全和性能。我们通过系统的分析和实验,评估TBFTFT(TF)的可比较性试验和结果,以显示更好的性能。