English
Related papers

Related papers: Automatic Integration of BFT State-Machine Replica…

200 papers

Byzantine fault tolerant protocols enable state replication in the presence of crashed, malfunctioning, or actively malicious processes. Designing such protocols without the assistance of verification tools, however, is remarkably…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-09-23 Joel Wanner , Laurent Chuat , Adrian Perrig

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

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

Hyperledger Fabric is an enterprise grade permissioned distributed ledger platform that offers modularity for a broad set of industry use cases. One modular component is a pluggable ordering service that establishes consensus on the order…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-07-16 Artem Barger , Yacov Manevich , Hagar Meir , Yoav Tock

One of the most celebrated problems of fault-tolerant distributed computing is the consensus problem. It was shown to abstract a myriad of problems in which processes have to agree on a single value. Consensus applications include…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-09-13 Romaric Duvignau , Michel Raynal , Elad Michael Schiller

The cost of Byzantine Fault Tolerant (BFT) storage is the main concern preventing its adoption in practice. This cost stems from the need to maintain at least 3t+1 replicas in different storage servers in the asynchronous model, so that t…

Distributed, Parallel, and Cluster Computing · Computer Science 2014-02-14 Christian Cachin , Dan Dobre , Marko Vukolic

Synchronous consensus protocols offer a significant advantage over their asynchronous and partially synchronous counterparts by providing higher fault tolerance -- an essential benefit in distributed systems, like blockchains, where…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-03-14 Nenad Milošević , Daniel Cason , Zarko Milošević , Robert Soulé , Fernando Pedone

Byzantine fault-tolerant (BFT) protocols allow a group of replicas to come to a consensus even when some of the replicas are Byzantine faulty. There exist multiple BFT protocols to securely tolerate an optimal number of faults $t$ under…

Cryptography and Security · Computer Science 2021-11-09 Peiyao Sheng , Gerui Wang , Kartik Nayak , Sreeram Kannan , Pramod Viswanath

Byzantine fault tolerant (BFT) protocol descriptions often assume application-layer networking primitives, such as best-effort and reliable broadcast, which are impossible to implement in practice in a Byzantine environment as they require…

Networking and Internet Architecture · Computer Science 2024-11-01 Manu Drijvers , Tim Gretler , Yotam Harchol , Tobias Klenze , Ognjen Maric , Stefan Neamtu , Yvonne-Anne Pignolet , Rostislav Rumenov , Daniel Sharifi , Victor Shoup

At PODC 2014, A. Most\'efaoui, H. Moumen, and M. Raynal presented a new and simple randomized signature-free binary consensus algorithm (denoted here MMR) that copes with the net effect of asynchrony Byzantine behaviors. Assuming message…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-01-24 Chryssis Georgiou , Ioannis Marcoullis , Michel Raynal , Elad Michael Schiller

Low-cost Internet of Things (IoT) devices are increasingly popular but often insecure due to poor update regimes. As a result, many devices run outdated and known-vulnerable versions of open-source software. We address this problem by…

Cryptography and Security · Computer Science 2025-10-17 Sebastian Jänich , Merlin Sievers , Johannes Kinder

We present Carnot, a leader-based Byzantine Fault Tolerant (BFT) consensus protocol that is responsive and operates under the partially synchronous model. Responsive BFT consensus protocols exhibit wire-speed operation and deliver…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-09-04 Mohammad M. Jalalzai , Alexander Mozeika , Marcin P. Pawlowski , Ganesh Narayanaswamy

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

Byzantine Fault-Tolerant (BFT) protocols have recently been extensively used by decentralized data management systems with non-trustworthy infrastructures, e.g., permissioned blockchains. BFT protocols cover a broad spectrum of design…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-08-05 Mohammad Javad Amiri , Chenyuan Wu , Divyakant Agrawal , Amr El Abbadi , Boon Thau Loo , Mohammad Sadoghi

This paper presents Mir-BFT, a robust Byzantine fault-tolerant (BFT) total order broadcast protocol aimed at maximizing throughput on wide-area networks (WANs), targeting deployments in decentralized networks, such as permissioned and…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-01-25 Chrysoula Stathakopoulou , Tudor David , Matej Pavlovic , Marko Vukolić

This paper presents Banyan, the first rotating leader state machine replication (SMR) protocol that allows transactions to be confirmed in just a single round-trip time in the Byzantine fault tolerance (BFT) setting. Based on minimal…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-12-12 Yann Vonlanthen , Jakub Sliwinski , Massimo Albarello , Roger Wattenhofer

All practical applications contain some degree of nondeterminism. When such applications are replicated to achieve Byzantine fault tolerance (BFT), their nondeterministic operations must be controlled to ensure replica consistency. To the…

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

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 address the challenges of Byzantine-robust training in asynchronous distributed machine learning systems, aiming to enhance efficiency amid massive parallelization and heterogeneous computing resources. Asynchronous systems, marked by…

Machine Learning · Computer Science 2025-06-05 Tehila Dahan , Kfir Y. Levy

IoT devices are decentralized and deployed in un-stable environments, which causes them to be prone to various kinds of faults, such as device failure and network disruption. Yet, current IoT platforms require programmers to handle faults…

Software Engineering · Computer Science 2020-02-19 Michael Norris , Berkay Celik , Patrick McDaniel , Gang Tan , Prasanna Venkatesh , Shulin Zhao , Anand Sivasubramaniam