\textsc{FnF-BFT}: a BFT protocol with provable performance under attack

DOI10.1007/978-3-031-32733-9_9OpenAlexW4377971770MaRDI QIDQ6188154

Lioba Heimbach, Roger Wattenhofer, Z. Avarikioti, Roland Schmid, Patrick Wintermeyer, Laurent Vanbever

Publication date: 11 January 2024

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-32733-9_9

zbMATH Keywords

SMRBFTByzantine-resilient performanceparallel leaders

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx) Communication complexity, information complexity (68Q11)

Cites Work

• Unnamed Item
• Byzantine-resistant total ordering algorithms.
• Bounds on information exchange for Byzantine agreement
• Impossibility of distributed consensus with one faulty process
• Reaching Agreement in the Presence of Faults
• The Byzantine Generals Problem
• HotStuff
• Jolteon and Ditto: network-adaptive efficient consensus with asynchronous fallback

This page was built for publication: \textsc{FnF-BFT}: a BFT protocol with provable performance under attack