تقرير
VBFT: Veloce Byzantine Fault Tolerant Consensus for Blockchains
| العنوان: | VBFT: Veloce Byzantine Fault Tolerant Consensus for Blockchains |
|---|---|
| المؤلفون: | Jalalzai, Mohammad M., Feng, Chen, Lemieux, Victoria |
| سنة النشر: | 2023 |
| المجموعة: | Computer Science |
| مصطلحات موضوعية: | Computer Science - Distributed, Parallel, and Cluster Computing |
| الوصف: | Low latency is one of the most desirable features of partially synchronous Byzantine consensus protocols. Existing low-latency protocols have achieved consensus with just two communication steps by reducing the maximum number of faults the protocol can tolerate (from $f = \frac{n-1}{3}$ to $f = \frac{n+1}{5}$), \textcolor{black}{by relaxing protocol safety guarantees}, or by using trusted hardware like Trusted Execution Environment. Furthermore, these two-step protocols don't support rotating leaders and low-cost view change (leader replacement), which are important features of many blockchain use cases. In this paper, we propose a protocol called VBFT which achieves consensus in just two communication steps without sacrificing desirable features. In particular, VBFT tolerates $f = \frac{n-1}{3}$ faults (which is the best possible), guarantees strong safety for honest leaders, and requires no trusted hardware. Moreover, VBFT supports leader rotation and low-cost view change, thereby improving prior art on multiple axes. Comment: arXiv admin note: substantial text overlap with arXiv:2109.14604 |
| نوع الوثيقة: | Working Paper |
| URL الوصول: | http://arxiv.org/abs/2310.09663 |
| رقم الأكسشن: | edsarx.2310.09663 |
| قاعدة البيانات: | arXiv |
| الوصف غير متاح. |