DAMYSUS

Streamlined BFT Consensus Leveraging Trusted Components

Conference paper (2022)

Authors

Jérémie Decouchant Data-Intensive Systems - EEMCS
David Kozhaya Abb Research
Vincent Rahli University of Birmingham
Jiangshan Yu Monash University
Research Group
Data-Intensive Systems (EEMCS) (TU Delft)
Copyright: © 2022 Jérémie Decouchant, David Kozhaya, Vincent Rahli, Jiangshan Yu
DOI: https://doi.org/10.1145/3492321.3519568
Fault tolerance Consensus Trusted component
More Info
expand_more

Published Date

2022

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Faculty

Electrical Engineering, Mathematics and Computer Science

Department

Software Technology

Research Group

Data-Intensive Systems

Abstract

Recently, streamlined Byzantine Fault Tolerant (BFT) consensus protocols, such as HotStuff, have been proposed as a means to circumvent the inefficient view-changes of traditional BFT protocols, such as PBFT. Several works have detailed trusted components, and BFT protocols that leverage them to tolerate a minority of faulty nodes and use a reduced number of communication rounds. Inspired by these works we identify two basic trusted services, respectively called the Checker and Accumulator services, which can be leveraged by streamlined protocols. Based on these services, we design Damysus, a streamlined protocol that improves upon HotStuff's resilience and uses less communication rounds. In addition, we show how the Checker and Accumulator services can be adapted to develop Chained-Damysus, a chained version of Damysus where operations are pipelined for efficiency. We prove the correctness of Damysus and Chained-Damysus, and evaluate their performance showcasing their superiority compared to previous protocols.