FnF-BFT: A BFT protocol with provable performance under attack
METADATA ONLY
Loading...
Author / Producer
Date
2023
Publication Type
Conference Paper
ETH Bibliography
yes
Citations
Altmetric
METADATA ONLY
Data
Rights / License
Abstract
We introduce FNF-BFT, the first partially synchronous BFT protocol with performance guarantees under truly byzantine attacks during stable networking conditions. At its core, FNF-BFT parallelizes the execution of requests by allowing all replicas to act as leaders independently. Leader parallelization distributes the load over all replicas. Consequently, FNF-BFT fully utilizes all correct replicas’ processing power and increases throughput by overcoming the single-leader bottleneck.
We prove lower bounds on FNF-BFT ’s efficiency and performance in synchrony: the amortized communication complexity is linear in the number of replicas and thus competitive with state-of-the-art protocols; FNF-BFT ’s amortized throughput with less than \(\frac{1}{3}\) byzantine replicas is at least \(\frac{16}{27}\)th of its best-case throughput. We also provide a proof-of-concept implementation and preliminary evaluation of FNF-BFT.
Permanent link
Publication status
published
External links
Book title
Structural Information and Communication Complexity
Journal / series
Volume
13892
Pages / Article No.
165 - 198
Publisher
Springer
Event
30th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2023)
Edition / version
Methods
Software
Geographic location
Date collected
Date created
Subject
BFT; SMR; Parallel leaders; Byzantine-resilient performance
Organisational unit
03604 - Wattenhofer, Roger / Wattenhofer, Roger
Notes
Conference lecture on June 8, 2023.