English
Related papers

Related papers: The Blocklace: A Byzantine-repelling and Universal…

200 papers

Multi-Byzantine Fault Tolerant (Multi-BFT) consensus, which runs multiple BFT instances in parallel, has recently emerged as a promising approach to overcome the leader bottleneck in classical BFT protocols. However, existing designs rely…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-01-27 Hanzheng Lyu , Shaokang Xie , Jianyu Niu , Mohammad Sadoghi , Yinqian Zhang , Cong Wang , Ivan Beschastnikh , Chen Feng

Despite decades of research and practical experience, developers have few tools for programming reliable distributed applications without resorting to expensive coordination techniques. Conflict-free replicated datatypes (CRDTs) are a…

Databases · Computer Science 2022-10-25 Shadaj Laddad , Conor Power , Mae Milano , Alvin Cheung , Natacha Crooks , Joseph M. Hellerstein

Geo-distributed systems often replicate data at multiple locations to achieve availability and performance despite network partitions. These systems must accept updates at any replica and propagate these updates asynchronously to every…

Programming Languages · Computer Science 2019-03-18 Constantin Enea , Suha Orhun Mutluergil , Gustavo Petri , Chao Wang

Ensuring that an AI system behaves reliably and as intended, especially in the presence of unexpected faults or adversarial conditions, is a complex challenge. Inspired by the field of Byzantine Fault Tolerance (BFT) from distributed…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-04-30 John deVadoss , Matthias Artzt

We study a framework for modeling distributed network systems assisted by a reliable and powerful cloud service. Our framework aims at capturing hybrid systems based on a point to point message passing network of machines, with the…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-09-29 John Augustine , Jeffin Biju , Shachar Meir , David Peleg , Srikkanth Ramachandran , Aishwarya Thiruvengadam

Due to the use of commodity software and hardware, crash-stop and Byzantine failures are likely to be more prevalent in today's large-scale distributed storage systems. Regenerating codes have been shown to be a more efficient way to…

Information Theory · Computer Science 2011-08-22 Yunghsiang S. Han , Rong Zheng , Wai Ho Mow

Consensus is one of the most fundamental distributed computing problems. In particular, it serves as a building block in many replication based fault-tolerant systems and in particular in multiple recent blockchain solutions. Depending on…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-08-08 Yehonatan Buchnik , Roy Friedman

The concept of distributed consensus originated in the 1970s and gained widespread attention following Leslie Lamport's influential publication on the Byzantine Generals Problem in the 1980s. Over the past five decades, distributed…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-05-13 Huanyu Wu , Chentao Yue , Yixuan Fan , Yonghui Li , Lei Zhang

Distributed control systems require high reliability and availability guarantees despite often being deployed at the edge of network infrastructure. Edge computing resources are less secure and less reliable than centralized resources in…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-02-21 Roy Shadmon , Daniel Spencer , Owen Arden

Recent developments in blockchain technology have inspired innovative new designs in resilient distributed and database systems. At their core, these blockchain applications typically use Byzantine fault-tolerant consensus protocols to…

Databases · Computer Science 2020-03-20 Suyash Gupta , Sajjad Rahnama , Jelle Hellings , Mohammad Sadoghi

Data is critical for the operation of any organization and needs to be protected, especially against attacks that compromise the state of the database. In this paper, we explore an approach based on Byzantine-fault tolerant replicated state…

Databases · Computer Science 2026-05-13 Anant Utgikar , S. Sudarshan

Conflict-free replicated data types (CRDTs) and the local-first concept are increasingly employed not only in small-scale collaboration systems among few users who trust each other, but also in large-scale systems, like Matrix for instant…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-04-28 Florian Jacob , Johanna Stuber , Hannes Hartenstein

We study a well-known communication abstraction called Byzantine Reliable Broadcast (BRB). This abstraction is central in the design and implementation of fault-tolerant distributed systems, as many fault-tolerant distributed applications…

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

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 2022-04-20 Alejandro Ranchal-Pedrosa , Vincent Gramoli

Blockchain technology has advanced rapidly in recent years and is now widely used in a variety of fields. Blockchain appears to be one of the best solutions for managing massive heterogeneous devices while achieving advanced data security…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-08-05 Xu Yuan , Fang Luo , Muhammad Zeeshan Haider , Zhikui Chen , Yucheng Li

State-based Conflict-free Replicated Data Types (CRDTs) are widely used in distributed systems to ensure high availability without coordination. However, their naive synchronization strategy - transmitting the full state - incurs high…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-05-05 Pedro Silva Gomes , Miguel Boaventura Rodrigues , Carlos Baquero

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

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

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

Threshold cryptography is essential for many blockchain protocols. For example, many protocols rely on threshold common coin to implement asynchronous consensus, leader elections, and provide support for randomized applications. Similarly,…

Cryptography and Security · Computer Science 2025-05-26 Zhuolun Xiang , Sourav Das , Zekun Li , Zhoujun Ma , Alexander Spiegelman