English
Related papers

Related papers: Information Theoretic HotStuff

200 papers

We present HotStuff, a leader-based Byzantine fault-tolerant replication protocol for the partially synchronous model. Once network communication becomes synchronous, HotStuff enables a correct leader to drive the protocol to consensus at…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-07-24 Maofan Yin , Dahlia Malkhi , Michael K. Reiter , Guy Golan Gueta , Ittai Abraham

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…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-01-29 Mohammad M. Jalalzai , Jianyu Niu , Chen Feng , Fangyu Gai

Byzantine consensus protocols are essential in blockchain technology. The widely recognized HotStuff protocol uses cryptographic measures for efficient view changes and reduced communication complexity. Recently, the main authors of…

Cryptography and Security · Computer Science 2024-03-28 Siyuan Zhao , Yanqi Wu , Zheng Wang

HotStuff is a state-of-the-art Byzantine fault-tolerant consensus protocol. It can be pipelined to build large-scale blockchains. One of its variants called LibraBFT is adopted in Facebook's Libra blockchain. Although it is well known that…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-07-13 Jianyu Niu , Fangyu Gai , Mohammad M. Jalalzai , Chen Feng

Consensus is a fundamental building block for constructing reliable and fault-tolerant distributed services. Many Byzantine fault-tolerant consensus protocols designed for partially synchronous systems adopt a pessimistic approach when…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-06-12 Diogo Avelãs , Hasan Heydari , Eduardo Alchieri , Tobias Distler , Alysson Bessani

The state-of-the-art HotStuff operates an efficient pipeline in which a stable leader drives decisions with linear communication and two round-trips of message. However, the unifying proposing-voting pattern is not sufficient to improve the…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-03-22 Taining Cheng

Byzantine consensus protocols aim at maintaining safety guarantees under any network synchrony model and at providing liveness in partially or fully synchronous networks. However, several Byzantine consensus protocols have been shown to…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-10-16 Jérémie Decouchant , Burcu Kulahcioglu Ozkan , Yanzhuo Zhou

Partially synchronous Byzantine consensus protocols typically structure their execution into a sequence of views, each with a designated leader process. The key to guaranteeing liveness in these protocols is to ensure that all correct…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-08-11 Manuel Bravo , Gregory Chockler , Alexey Gotsman

This paper introduces HotStuff-1, a BFT consensus protocol that improves the latency of HotStuff-2 by two network hops while maintaining linear communication complexity against faults. Furthermore, HotStuff-1 incorporates an…

Databases · Computer Science 2025-04-25 Dakai Kang , Suyash Gupta , Dahlia Malkhi , Mohammad Sadoghi

We present an algorithm for synchronous deterministic Byzantine consensus, tolerant to links failures and links asynchrony. It cares for a class of networks with specific needs, where both safety and liveness are essential, and timely…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-05-24 Ivan Klianev

LibraBFT is a Byzantine Fault Tolerant (BFT) consensus protocol based on HotStuff. We present an abstract model of the protocol underlying HotStuff / LibraBFT, and formal, machine-checked proofs of their core correctness (safety) property…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-03-30 Harold Carr , Christopher Jenkins , Mark Moir , Victor Cacciari Miraldo , Lisandra Silva

This paper introduces Hamster, a novel synchronous Byzantine Fault Tolerance protocol that achieves better performance and has weaker dependency on synchrony. Specifically, Hamster employs coding techniques to significantly decrease…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-10-01 Ximing Fu , Mo Li , Qingming Zeng , Tianyang Li , Shenghao Yang , Yonghui Guan , Chuanyi Liu

Achieving agreement among distributed parties is a fundamental task in modern systems, underpinning applications such as consensus in blockchains, coordination in cloud infrastructure, and fault tolerance in critical services. However, this…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-02-18 Andrei Constantinescu , Marc Dufay , Anton Paramonov , Roger Wattenhofer

To circumvent the FLP impossibility result in a deterministic way several protocols have been proposed on top of an asynchronous distributed system enriched with additional assumptions. In the context of Byzantine failures for systems where…

Distributed, Parallel, and Cluster Computing · Computer Science 2015-02-03 Hamouma Moumen

Byzantine Fault Tolerant (BFT) consensus, a cornerstone of blockchain technology, has seen significant advancements. While existing BFT protocols ensure security guarantees, they often suffer from efficiency challenges, particularly under…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-04-15 Qingming Zeng , Mo Li , Ximing Fu , Chuanyi Liu , Hui Jiang

The proliferation of Internet of Things devices in critical infrastructure has created unprecedented cybersecurity challenges, necessitating collaborative threat detection mechanisms that preserve data privacy while maintaining robustness…

Cryptography and Security · Computer Science 2026-01-06 Milad Rahmati , Nima Rahmati

Streamlined Byzantine Fault Tolerant (BFT) protocols, such as HotStuff [PODC'19], and weighted voting represent two possible strategies to improve consensus in the distributed systems world. Several studies have been conducted on both…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-10-30 Diana Micloiu , Rowdy Chotkan , Jérémie Decouchant

The accelerated digitalisation of society along with technological evolution have extended the geographical span of cyber-physical systems. Two main threats have made the reliable and real-time control of these systems challenging: (i)…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-03-19 David Kozhaya , Jeremie Decouchant , Vincent Rahli , Paulo Esteves-Verissimo

Byzantine reliable broadcast is a fundamental primitive in distributed systems that allows a set of processes to agree on a message broadcast by a dedicated process, even when some of them are malicious (Byzantine). It guarantees that no…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-10-01 Veronika Anikina , João Paulo Bezerra , Petr Kuznetsov , Liron Schiff , Stefan Schmid

This article will take you on a journey to the core of blockchains, their Byzantine consensus engine, where HotStuff emerged as a new algorithmic foundation for the classical Byzantine generals consensus problem. The first part of the…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-05-24 Dahlia Malkhi , Maofan Yin
‹ Prev 1 2 3 10 Next ›