English
Related papers

Related papers: Simulating BFT Protocol Implementations at Scale

200 papers

With the emergence of large-scale decentralized applications, a scalable and efficient Byzantine Fault Tolerant (BFT) protocol of hundreds of replicas is desirable. Although the throughput of existing leader-based BFT protocols has reached…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-02-08 Kexin Hu , Kaiwen Guo , Qiang Tang , Zhenfeng Zhang , Hao Cheng , Zhiyang Zhao

The spectacular success of Bitcoin and Blockchain Technology in recent years has provided enough evidence that a widespread adoption of a common cryptocurrency system is not merely a distant vision, but a scenario that might come true in…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-08-30 Adam Gągol , Damian Leśniak , Damian Straszak , Michał Świętek

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 COVID-19 pandemic necessitated the emergence of decentralized Clinical Trials (DCTs) due to patient retention, accelerate trials, improve data accessibility, enable virtual care, and facilitate seamless communication through integrated…

Cryptography and Security · Computer Science 2024-09-02 Ashok Kumar Peepliwall , Hari Mohan Pandey , Surya Prakash , Anand A Mahajan , Sudhinder Singh Chowhan , Vinesh Kumar , Rahul Sharma

The security of many Proof-of-Stake (PoS) payment systems relies on quorum-based State Machine Replication (SMR) protocols. While classical analyses assume purely Byzantine faults, real-world systems must tolerate both arbitrary failures…

Cryptography and Security · Computer Science 2026-05-19 Zeta Avarikioti , Eleftherios Kokoris Kogias , Ray Neiheiser , Christos Stefo

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

Distributed, Parallel, and Cluster Computing · Computer Science 2024-05-29 Yacov Manevich , Hagar Meir , Kaoutar Elkhiyaoui , Yoav Tock , May Buzaglo

The ability to perform repeated Byzantine agreement lies at the heart of important applications such as blockchain price oracles or replicated state machines. Any such protocol requires the following properties: (1) \textit{Byzantine…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-06-17 Shlomi Dolev , Amit Hendin , Maurice Herlihy , Maria Potop Butucaru , Elad Michael Schiller

Fault-tolerant consensus has been studied extensively in the literature, because it is one of the most important distributed primitives and has wide applications in practice. This paper surveys important results on fault-tolerant consensus…

Distributed, Parallel, and Cluster Computing · Computer Science 2016-08-30 Lewis Tseng

The paper presents Tendermint, a new protocol for ordering events in a distributed network under adversarial conditions. More commonly known as Byzantine Fault Tolerant (BFT) consensus or atomic broadcast, the problem has attracted…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-11-25 Ethan Buchman , Jae Kwon , Zarko Milosevic

Motivated by proof-of-stake (PoS) blockchains such as Ethereum, two key desiderata have recently been studied for Byzantine-fault tolerant (BFT) state-machine replication (SMR) consensus protocols: Finality means that the protocol retains…

Cryptography and Security · Computer Science 2024-01-22 Joachim Neu , Ertem Nusret Tas , David Tse

Hybrid fault models are known to be an effective means for enhancing the robustness of consensus-based replicated systems. However, existing hybridization approaches suffer from limited flexibility with regard to the composition of…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-08-15 Laura Lawniczak , Tobias Distler

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

In this paper, we present a Byzantine fault tolerant distributed commit protocol for transactions running over untrusted networks. The traditional two-phase commit protocol is enhanced by replicating the coordinator and by running a…

Distributed, Parallel, and Cluster Computing · Computer Science 2016-11-17 Wenbing Zhao

This paper introduces a new way to incorporate verifiable secret sharing (VSS) schemes into Byzantine Fault Tolerance (BFT) protocols. This technique extends the threshold guarantee of classical Byzantine Fault Tolerant algorithms to…

Cryptography and Security · Computer Science 2018-12-27 Soumya Basu , Alin Tomescu , Ittai Abraham , Dahlia Malkhi , Michael K. Reiter , Emin Gün Sirer

We present new protocols for Byzantine state machine replication and Byzantine agreement in the synchronous and authenticated setting. The celebrated PBFT state machine replication protocol tolerates $f$ Byzantine faults in an asynchronous…

Distributed, Parallel, and Cluster Computing · Computer Science 2017-09-14 Ittai Abraham , Srinivas Devadas , Danny Dolev , Kartik Nayak , Ling Ren

Transactions involving multiple blockchains are implemented by cross-chain protocols. These protocols are based on smart contracts, programs that run on blockchains, executed by a network of computers. Because smart contracts can…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-05-09 Ritam Ganguly , Yingjie Xue , Aaron Jonckheere , Parker Ljung , Benjamin Schornstein , Borzoo Bonakdarpour , Maurice Herlihy

Asynchronous Byzantine fault-tolerant (BFT) consensus protocols, known for their robustness in unpredictable environments without relying on timing assumptions, are becoming increasingly vital for wireless applications. While these…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-04-08 Shuo Liu , Minghui Xu , Tianyi Sun , Xiuzhen Cheng

Byzantine-fault-tolerant (BFT) protocols underlie a variety of decentralized applications including payments, auctions, data feed oracles, and decentralized social networks\cite{chainlink,lens}. In most leader-based BFT protocols, an…

Cryptography and Security · Computer Science 2023-09-26 Bowen Xue , Soubhik Deb , Sreeram Kannan

In this note, we revisit EZBFT[2] and present safety, liveness and execution consistency violations in the protocol. To demonstrate these violations, we present simple scenarios, involving only four replicas, two clients, and one or two…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-09-10 Nibesh Shrestha , Mohan Kumar

Low Earth Orbit (LEO) satellite constellations are evolving from communication relays into autonomous platforms operating in increasingly congested and contested environments. Since uplinks to ground stations can be severed or jammed,…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-05-12 Tianyi Sun , Shuo Liu , Minghui Xu , Xiuzhen Cheng