使用可信单调计数器使推测性BFT具有弹性
Making Speculative BFT Resilient with Trusted Monotonic Counters
摘要:
流行的分布式账本使用的共识机制具有高度可扩展性,但众所周知效率低下。拜占庭容错(Byzantine fault tolerance,BFT)协议是高效的,但可扩展性差得多。诸如Zyzzyva和Zyzzyva5之类的推测性BFT协议是有效的和可扩展的,但是需要权衡:Zyzzyva仅需要$3f + 1$副本来容忍$f$故障,但是即使是单个慢副本也会使Zyzzyva退回到更昂贵的非推测性操作。Zyzzyva5不需要非推测回退,但需要$5f + 1$副本以容忍$f$故障。使用硬件辅助的可信组件的BFT变体可以容忍更大比例的故障,但要求每个副本都具有此硬件。我们提出SACZyzzyva,解决这些问题:弹性慢副本,只需要$3f + 1$副本,只有一个副本需要一个积极的单调计数器在任何给定的时间。我们实验评估我们的协议,表现出低延迟和高可扩展性。我们证明了SACZyzzyva是最佳的鲁棒性和可信的组件不能增加容错,除非它们存在于大于三分之二的副本。
英文摘要:
Consensus mechanisms used by popular distributed ledgers are highly scalable but notoriously inefficient. Byzantine fault tolerance (BFT) protocols are efficient but far less scalable. Speculative BFT protocols such as Zyzzyva and Zyzzyva5 are efficient and scalable but require a trade-off: Zyzzyva requires only $3f + 1$ replicas to tolerate $f$ faults, but even a single slow replica will make Zyzzyva fall back to more expensive non-speculative operation. Zyzzyva5 does not require a non-speculative fallback, but requires $5f + 1$ replicas in order to tolerate $f$ faults. BFT variants using hardware-assisted trusted components can tolerate a greater proportion of faults, but require that every replica have this hardware. We present SACZyzzyva, addressing these concerns: resilience to slow replicas and requiring only $3f + 1$ replicas, with only one replica needing an active monotonic counter at any given time. We experimentally evaluate our protocols, demonstrating low latency and high scalability. We prove that SACZyzzyva is optimally robust and that trusted components cannot increase fault tolerance unless they are present in greater than two-thirds of replicas.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。