English
Related papers

Related papers: Revisiting Fast Practical Byzantine Fault Toleranc…

200 papers

Conformance checking techniques are widely adopted to pinpoint possible discrepancies between process models and the execution of the process in reality. However, state of the art approaches adopt a crisp evaluation of deviations, with the…

Artificial Intelligence · Computer Science 2020-01-30 Sicui Zhang , Laura Genga , Hui Yan , Xudong Lu , Huilong Duan , Uzay Kaymak

Organizations are increasingly adopting and adapting Large Language Models (LLMs) hosted on public repositories such as HuggingFace. Although these adaptations often improve performance on specialized downstream tasks, recent evidence…

Artificial Intelligence · Computer Science 2025-11-04 Mina Taraghi , Yann Pequignot , Amin Nikanjam , Mohamed Amine Merzouk , Foutse Khomh

Byzantine Fault Tolerant (BFT) consensus protocols for dynamically available systems face a critical challenge: balancing latency and security in fluctuating node participation. Existing solutions often require multiple rounds of voting per…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-09-04 Pengkun Ren , Hai Dong , Zahir Tari , Pengcheng Zhang

A framework is proposed to assess the safety of maintenance work zones in a timely manner, show whether there are safety hazards, whether adjustments need to be made and how to adjust it. By means of advanced data acquisition technologies…

Other Computer Science · Computer Science 2019-11-05 Zhepu Xu , Qun Yang

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

LibraBFT is a Byzantine Fault Tolerant (BFT) consensus protocol based on HotStuff. We present an abstract model of the protocol underlying HotStuff / LibraBFT, and formal, machine-checked proofs of their core correctness (safety) property…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-03-30 Harold Carr , Christopher Jenkins , Mark Moir , Victor Cacciari Miraldo , Lisandra Silva

This paper presents DuoBFT, a Byzantine fault-tolerant protocol that uses trusted components to provide commit decisions in the Hybrid fault model in addition to commit decisions in the BFT model. By doing so, it enables the clients to…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-02-09 Balaji Arun , Binoy Ravindran

We formalize Byzantine linearizability, a correctness condition that specifies whether a concurrent object with a sequential specification is resilient against Byzantine failures. Using this definition, we systematically study…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-06-06 Shir Cohen , Idit Keidar

In this paper we analyse the correctness of Istanbul BFT (IBFT), which is a Byzantine-fault-tolerant (BFT) proof-of-authority (PoA) blockchain consensus protocol that ensures immediate finality. We show that the IBFT protocol does not…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-08-28 Roberto Saltini , David Hyland-Wood

The HotStuff protocol is a breakthrough in Byzantine Fault Tolerant (BFT) consensus that enjoys both responsiveness and linear view change. It creatively adds an additional round to classic BFT protocols (like PBFT) using two rounds. This…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-01-29 Mohammad M. Jalalzai , Jianyu Niu , Chen Feng , Fangyu Gai

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

Distributed, Parallel, and Cluster Computing · Computer Science 2023-12-22 Yacov Manevich

Classic Byzantine fault-tolerant consensus protocols forfeit liveness in the face of asynchrony in order to preserve safety, whereas most deployed blockchain protocols forfeit safety in order to remain live. In this work, we achieve the…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-07-06 Alistair Stewart , Eleftherios Kokoris-Kogia

Low latency is one of the most desirable features of partially synchronous Byzantine consensus protocols. Existing low-latency protocols have achieved consensus with just two communication steps by reducing the maximum number of faults the…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-01-30 Mohammad M. Jalalzai , Chen Feng , Victoria Lemieux

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

Modern high-performance computing relies heavily on the use of commodity processors arranged together in clusters. These clusters consist of individual nodes (typically off-the-shelf single or dual processor machines) connected together…

Distributed, Parallel, and Cluster Computing · Computer Science 2007-05-23 Dmitry Mogilevsky , Sean Keller

Given sufficient data from multiple edge devices, federated learning (FL) enables training a shared model without transmitting private data to the central server. However, FL is generally vulnerable to Byzantine attacks from compromised…

Machine Learning · Computer Science 2025-09-18 Youngjoon Lee , Jinu Gong , Joonhyuk Kang

The growing interest in reliable multi-party applications has fostered widespread adoption of Byzantine Fault-Tolerant (BFT) consensus protocols. Existing BFT protocols need f more replicas than Paxos-style protocols to prevent equivocation…

Databases · Computer Science 2022-11-03 Suyash Gupta , Sajjad Rahnama , Shubham Pandey , Natacha Crooks , Mohammad Sadoghi

Fine-tuning a general-purpose large language model (LLM) for a specific domain or task has become a routine procedure for ordinary users. However, fine-tuning is known to remove the safety alignment features of the model, even when the…

Computation and Language · Computer Science 2025-06-23 Kathleen C. Fraser , Hillary Dawkins , Isar Nejadgholi , Svetlana Kiritchenko

The parallel Byzantine Fault Tolerant (BFT) protocol is viewed as a promising solution to address the consensus scalability issue of the permissioned blockchain. One of the main challenges in parallel BFT is the view change process that…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-01-15 Yifei Xie , Btissam Er-Rahmadi , Xiao Chen , Tiejun Ma , Jane Hillston

Paxos, Viewstamped Replication, and Zab are replication protocols that ensure high-availability in asynchronous environments with crash failures. Various claims have been made about similarities and differences between these protocols. But…

Distributed, Parallel, and Cluster Computing · Computer Science 2014-03-03 Robbert Van Renesse , Nicolas Schiper , Fred B. Schneider