English
Related papers

Related papers: LinBFT: Linear-Communication Byzantine Fault Toler…

200 papers

The increasing application and deployment of blockchain in various services necessitates the assurance of the effectiveness of PBFT (Practical Byzantine Fault Tolerance) consensus service. However, the performance of PBFT consensus service…

Software Engineering · Computer Science 2025-04-15 Yujing Cai , Yukun Meng , Weimeng Wang , Xuanming Zhang , Xiaolin Chang

Hyperledger Fabric (HLF) is a flexible permissioned blockchain platform designed for business applications beyond the basic digital coin addressed by Bitcoin and other existing networks. A key property of HLF is its extensibility, and in…

Cryptography and Security · Computer Science 2017-09-21 João Sousa , Alysson Bessani , Marko Vukolić

Reliable broadcast (RBC) is a key primitive in fault-tolerant distributed systems, and improving its efficiency can benefit a wide range of applications. This work focuses on signature-free RBC protocols, which are particularly attractive…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-05-26 Nibesh Shrestha , Qianyu Yu , Aniket Kate , Giuliano Losa , Kartik Nayak , Xuechao Wang

Byzantine agreement (BA), the task of $n$ parties to agree on one of their input bits in the face of malicious agents, is a powerful primitive that lies at the core of a vast range of distributed protocols. Interestingly, in protocols with…

Cryptography and Security · Computer Science 2023-10-23 Elette Boyle , Ran Cohen , Aarushi Goel

We consider the problem of varying the security of blockchain transactions according to their importance. This adaptive security is achieved by using variable size consensus committees. To improve performance, such committees function…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-08-01 Shishir Rai , Kendric Hood , Mikhail Nesterenko , Gokarna Sharma

Blockchain technology sparked renewed interest in planetary-scale Byzantine fault-tolerant (BFT) state machine replication (SMR). While recent works predominantly focused on improving the scalability and throughput of these protocols, few…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-10-01 Christian Berger , Lívio Rodrigues , Hans P. Reiser , Vinicius Cogo , Alysson Bessani

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

Byzantine Agreement is a key component in many distributed systems. While Dolev and Reischuk have proven a long time ago that quadratic communication complexity is necessary for worst-case runs, the question of what can be done in…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-01-12 Shir Cohen , Idit Keidar , Alexander Spiegelman

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

Cryptocurrencies, based on and led by Bitcoin, have shown promise as infrastructure for pseudonymous online payments, cheap remittance, trustless digital asset exchange, and smart contracts. However, Bitcoin-derived blockchain protocols…

Cryptography and Security · Computer Science 2015-11-12 Ittay Eyal , Adem Efe Gencer , Emin Gun Sirer , Robbert van Renesse

Many blockchain platform are subject to maximal value extraction (MEV), and users on the platform are losing money while sending transactions because the transaction order can be manipulated to extract value from them. Consensus protocols…

Cryptography and Security · Computer Science 2024-01-05 Bowen Xue , Sreeram Kannan

Trust is the basis of any distributed, fault-tolerant, or secure system. A trust assumption specifies the failures that a system, such as a blockchain network, can tolerate and determines the conditions under which it operates correctly. In…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-07-26 Orestis Alpos , Christian Cachin , Luca Zanolini

Despite years of intensive research, Byzantine fault-tolerant (BFT) systems have not yet been adopted in practice. This is due to additional cost of BFT in terms of resources, protocol complexity and performance, compared with crash…

Distributed, Parallel, and Cluster Computing · Computer Science 2016-11-09 Shengyun Liu , Paolo Viotti , Christian Cachin , Vivien Quéma , Marko Vukolić

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

Replication protocols are essential for distributed systems, ensuring consistency, reliability, and fault tolerance. Traditional Crash Fault Tolerant (CFT) protocols, which assume a fail-stop model, are inadequate for untrusted cloud…

Cryptography and Security · Computer Science 2025-02-14 Dimitra Giantsidi , Emmanouil Giortamis , Julian Pritzi , Maurice Bailleu , Manos Kapritsos , Pramod Bhatotia

The blockchain technology has achieved tremendous success in open (permissionless) decentralized consensus by employing proof-of-work (PoW) or its variants, whereby unauthorized nodes cannot gain disproportionate impact on consensus beyond…

Information Theory · Computer Science 2018-03-26 Zhiyuan Jiang , Bhaskar Krishnamachari , Sheng Zhou , Zhisheng Niu

This work performs an experimental evaluation of four asynchronous binary Byzantine consensus algorithms [11,16,18] in various configurations. In addition to being asynchronous these algorithms run in rounds, tolerate up to one third of…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-04-24 Tyler Crain

We present ChonkyBFT, a partially-synchronous Byzantine fault-tolerant (BFT) consensus protocol used in the ZKsync system. The proposed protocol is a hybrid protocol inspired by FAB Paxos, Fast-HotStuff, and HotStuff-2. It is a…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-03-20 Bruno França , Denis Kolegov , Igor Konnov , Grzegorz Prusak

This paper introduces a new family of consensus protocols, namely \emph{Lachesis-class} denoted by $\mathcal{L}$, for distributed networks with guaranteed Byzantine fault tolerance. Each Lachesis protocol $L$ in $\mathcal{L}$ has complete…

Distributed, Parallel, and Cluster Computing · Computer Science 2018-10-05 Sang-Min Choi , Jiho Park , Quan Nguyen , Andre Cronje , Kiyoung Jang , Hyunjoon Cheon , Yo-Sub Han , Byung-Ik Ahn

Consensus protocols have traditionally been studied in a setting where all participants are known to each other from the start of the protocol execution. In the parlance of the 'blockchain' literature, this is referred to as the…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-01-25 Andrew Lewis-Pye , Tim Roughgarden