Fast-HotStuff: A Fast and Resilient HotStuff Protocol

October 22, 2020 Β· Declared Dead Β· πŸ› IEEE Transactions on Dependable and Secure Computing

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Mohammad M. Jalalzai, Jianyu Niu, Chen Feng, Fangyu Gai arXiv ID 2010.11454 Category cs.DC: Distributed Computing Citations 44 Venue IEEE Transactions on Dependable and Secure Computing Last Checked 6 months ago
Abstract
The HotStuff protocol is a breakthrough in Byzantine Fault Tolerant (BFT) consensus that enjoys both responsiveness and linear view change. It creatively adds an additional round to classic BFT protocols (like PBFT) using two rounds. This brings us to an interesting question: Is this additional round really necessary in practice? In this paper, we answer this question by designing a new two-round BFT protocol called Fast-HotStuff, which enjoys responsiveness and efficient view change that is comparable to linear view change in terms of performance. Compared to (three-round) HotStuff, Fast-HotStuff has lower latency and is more robust against performance attacks that HotStuff is susceptible to.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Distributed Computing

Died the same way β€” πŸ‘» Ghosted