English
Related papers

Related papers: Falcon: Advancing Asynchronous BFT Consensus for L…

200 papers

Since the inception of Bitcoin, the distributed systems community has shown interest in the design of efficient blockchain systems. However, initial blockchain applications (like Bitcoin) attain very low throughput, which has promoted the…

Databases · Computer Science 2020-04-28 Suyash Gupta , Sajjad Rahnama , Mohammad Sadoghi

We introduce FnF-BFT, a parallel-leader byzantine fault-tolerant state-machine replication protocol for the partially synchronous model with theoretical performance bounds during synchrony. By allowing all replicas to act as leaders and…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-03-11 Zeta Avarikioti , Lioba Heimbach , Roland Schmid , Laurent Vanbever , Roger Wattenhofer , Patrick Wintermeyer

Multi-Byzantine Fault Tolerant (Multi-BFT) consensus allows multiple consensus instances to run in parallel, resolving the leader bottleneck problem inherent in classic BFT consensus. However, the global ordering of Multi-BFT consensus…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-03-04 Hanzheng Lyu , Shaokang Xie , Jianyu Niu , Ivan Beschastnikh , Yinqian Zhang , Mohammad Sadoghi , Chen Feng

Permissioned Blockchains are increasingly considered in enterprise use-cases, many of which do not require geo-distribution, or even disallow it due to legislation. Examples include country-wide networks, such as Alastria, or those deployed…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-07-27 Manuel Bravo , Zsolt István , Man-Kit Sit

There is surge of interest to the blockchain technology not only in the scientific community but in the business community as well. Proof of Work (PoW) and Byzantine Fault Tolerant (BFT) are the two main classes of consensus protocols that…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-06-12 Mohammad M. Jalalzai , Costas Busch

This paper introduces a deterministic Byzantine consensus algorithm that relies on a new weak coordinator. As opposed to previous algorithms that cannot terminate in the presence of a faulty or slow coordinator, our algorithm can terminate…

Distributed, Parallel, and Cluster Computing · Computer Science 2018-07-26 Tyler Crain , Vincent Gramoli , Mikel Larrea , Michel Raynal

Mission critical systems deployed in data centers today are facing more sophisticated failures. Byzantine fault tolerant (BFT) protocols are capable of masking these types of failures, but are rarely deployed due to their performance cost…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-10-25 Guangda Sun , Xin Zhe Khooi , Yunfan Li , Mingliang Jiang , Jialin Li

We present Egalitarian BFT (EBFT), a simple and high-performance framework of BFT consensus protocols for decentralized systems like blockchains. The key innovation in EBFT is egalitarian block generation: nodes randomly and…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-03-14 Jianyu Niu , Runchao Han , Shengqi Liu , Fangyu Gai , Ivan Beschastnikh , Yinqian Zhang , Chen Feng

Despite recent progresses of practical asynchronous Byzantine fault tolerant (BFT) consensus, the state-of-the-art designs still suffer from suboptimal performance. Particularly, to obtain maximum throughput, most existing protocols with…

Cryptography and Security · Computer Science 2024-02-02 Yingzi Gao , Yuan Lu , Zhenliang Lu , Qiang Tang , Jing Xu , Zhenfeng Zhang

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

Blockchain systems are designed, built and operated in the presence of failures. There are two dominant failure models, namely crash fault and Byzantine fault. Byzantine fault tolerance (BFT) protocols offer stronger security guarantees,…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-08-04 Mingyuan Gao , Hung Dang , Ee-Chien Chang , Jialin Li

We present ezBFT, a novel leaderless, distributed consensus protocol capable of tolerating byzantine faults. ezBFT's main goal is to minimize the client-side latency in WAN deployments. It achieves this by (i) having no designated primary…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-04-15 Balaji Arun , Sebastiano Peluso , Binoy Ravindran

Distributed Software Defined Networking (SDN) controllers aim to solve the issue of single-point-of-failure and improve the scalability of the control plane. Byzantine and faulty controllers, however, may enforce incorrect configurations…

Networking and Internet Architecture · Computer Science 2019-02-25 Ermin Sakic , Wolfgang Kellerer

State-of-the-art asynchronous Byzantine fault-tolerant (BFT) protocols, such as HoneyBadgerBFT, BEAT, and Dumbo, have shown a performance comparable to partially synchronous BFT protocols. This paper studies two practical directions in…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-08-24 Chao Liu , Sisi Duan , Haibin Zhang

This paper presents a partially synchronous BFT consensus protocol powered by BBCA, a lightly modified Byzantine Consistent Broadcast (BCB) primitive. BBCA provides a Complete-Adopt semantic through an added probing interface to allow…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-05-28 Dahlia Malkhi , Chrysoula Stathakopoulou , Maofan Yin

Byzantine fault tolerant (BFT) state machine replication (SMR) is an important building block for constructing permissioned blockchain systems. In contrast to Nakamoto Consensus where any block obtains higher assurance as buried deeper in…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-01-12 Zhuolun Xiang , Dahlia Malkhi , Kartik Nayak , Ling Ren

Existing Byzantine fault tolerance (BFT) protocols face significant challenges in the consortium blockchain scenario. On the one hand, we can make little assumptions about the reliability and security of the underlying Internet. On the…

Distributed, Parallel, and Cluster Computing · Computer Science 2018-02-06 Peilun Li , Guosai Wang , Xiaoqi Chen , Wei Xu

The popularization of blockchains leads to a resurgence of interest in Byzantine Fault-Tolerant (BFT) state machine replication protocols. However, much of the work on this topic focuses on the underlying consensus protocols, with emphasis…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-05-01 Alysson Bessani , Eduardo Alchieri , João Sousa , André Oliveira , Fernando Pedone

Consensus in decentralized systems that asynchronously receive events and which are subject to Byzantine faults is a common problem with many real-life applications. Advances in decentralized systems, such as distributed ledger (i.e.,…

Distributed, Parallel, and Cluster Computing · Computer Science 2018-09-05 Fedor Muratov , Andrei Lebedev , Nikolai Iushkevich , Bulat Nasrulin , Makoto Takemiya

Arma is a Byzantine Fault Tolerant (BFT) consensus system designed to achieve linear scalability across all hardware resources: network bandwidth, CPU, and disk I/O. As opposed to preceding BFT protocols, Arma separates the dissemination…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-12-22 Yacov Manevich