English
Related papers

Related papers: CFT-Forensics: High-Performance Byzantine Accounta…

200 papers

Cyber-physical systems and the Internet of things (IoT) is becoming an integral part of the digital society. The use of IoT services improves human life in many ways. Protection against cyber threats is an important aspect of the…

Cryptography and Security · Computer Science 2021-04-21 Yaroslav Meshcheryakov , Anna Melman , Oleg Evsutin , Vladimir Morozov , Yevgeni Koucheryavy

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

Fault tolerant consensus protocols usually involve ordered rounds of voting between a collection of processes. In this paper, we derive a general specification of fault tolerant asynchronous consensus protocols and present a class of…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-08-29 Robbert van Renesse

Large-scale, fault-tolerant, distributed systems are the backbone for many critical software services. Since they must execute correctly in a possibly adversarial environment with arbitrary communication delays and failures, the underlying…

Programming Languages · Computer Science 2023-04-25 Cezara Dragoi , Constantin Enea , Srinidhi Nagendra , Mandayam Srivas

Motivated, in part, by the rise of permissionless systems such as Bitcoin where arbitrary nodes (whose identities are not known apriori) can join and leave at will, we extend established research in scalable Byzantine agreement to a more…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-07-26 John Augustine , Valerie King , Anisur R. Molla , Gopal Pandurangan , Jared Saia

Conflict-free Replicated Data Types (CRDTs) are designed for replica convergence without global coordination or consensus. Recent work has achieved the same in a Byzantine environment, through DAG-like structures based on cryptographic…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-01-23 Paulo Sérgio Almeida , Ehud Shapiro

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

As Byzantine Fault Tolerant (BFT) protocols begin to be used in permissioned blockchains for user-facing applications such as payments, it is crucial that they provide low latency. In pursuit of low latency, some recently proposed BFT…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-01-08 Daniel Qian , Xiyu Hao , Jinkun Geng , Yuncheng Yao , Aurojit Panda , Jinyang Li , Anirudh Sivaraman

Consensus, abstracting a myriad of problems in which processes have to agree on a single value, is one of the most celebrated problems of fault-tolerant distributed computing. Consensus applications include fundamental services for the…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-11-16 Romaric Duvignau , Michel Raynal , Elad Michael Schiller

It is well known that Byzantine fault tolerant (BFT) consensus cannot be solved in the classic asynchronous message passing model when one-third or more of the processes may be faulty. Since many modern applications require higher fault…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-05-25 Naama Ben-David , Kartik Nayak

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

Recent advances in generative AI have enabled sophisticated multi-agent architectures for healthcare, where large language models power collaborative clinical decision-making. However, these distributed systems face critical challenges in…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-12-23 Nihir Chadderwala

There has been recently a lot of progress in designing efficient partially synchronous BFT consensus protocols that are meant to serve as core consensus engines for Proof of Stake blockchain systems. While the state-of-the-art solutions…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-01-19 Daniel Kane , Andreas Fackler , Adam Gągol , Damian Straszak

Despite broad use of BFT consensus in blockchains, censorship resistance is weak: leaders can exclude transactions, a growing concern for trading and DeFi. We address this by introducing a new abstraction and protocol stack. First, we…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-02-04 Zhuolun Xiang , Andrei Tonkikh , Alexander Spiegelman

The problem of Byzantine consensus has been key to designing secure distributed systems. However, it is particularly difficult, mainly due to the presence of Byzantine processes that act arbitrarily and the unknown message delays in general…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-05-05 Alejandro Ranchal-Pedrosa , Vincent Gramoli

It is well known that a trusted setup allows one to solve the Byzantine agreement problem in the presence of $t<n/2$ corruptions, bypassing the setup-free $t<n/3$ barrier. Alas, the overwhelming majority of protocols in the literature have…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-10-17 Daniel Collins , Yuval Efron , Jovan Komatovic

This paper describes a simple and efficient asynchronous Binary Byzantine faulty tolerant consensus algorithm. In the algorithm, non-faulty nodes perform an initial broadcast followed by a executing a series of rounds each consisting of a…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-02-12 Tyler Crain

As Internet of Vehicles (IoV) technology continues to advance, edge computing has become an important tool for assisting vehicles in handling complex tasks. However, the process of offloading tasks to edge servers may expose vehicles to…

Networking and Internet Architecture · Computer Science 2025-06-18 Cui Zhang , Maoxin Ji , Qiong Wu , Pingyi Fan , Qiang Fan

Blockchain technology enables stakeholders to conduct trusted data sharing and exchange without a trusted centralized institution. These features make blockchain applications attractive to enhance trustworthiness in very different contexts.…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-07-18 Xiaohui Zhang , Mingying Xue , Xianghua Miao

Several research projects have shown that Byzantine fault tolerance (BFT) is practical today in terms of performance. Deficiencies in other aspects might still be an obstacle to a more wide-spread deployment in real-world applications. One…

Cryptography and Security · Computer Science 2012-04-12 Benedikt Höfling , Hans P. Reiser