English
Related papers

Related papers: SplitBFT: Improving Byzantine Fault Tolerance Safe…

200 papers

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 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

Blockchain technologies are facing a scalability challenge, which must be overcome to guarantee a wider adoption of the technology. This scalability issue is due to the use of consensus algorithms to guarantee the total order of the chain…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-02-10 Margarita Capretto , Martín Ceresa , Antonio Fernández Anta , Antonio Russo , César Sánchez

Distributed learning has emerged as a leading paradigm for training large machine learning models. However, in real-world scenarios, participants may be unreliable or malicious, posing a significant challenge to the integrity and accuracy…

Machine Learning · Computer Science 2024-06-10 Grigory Malinovsky , Peter Richtárik , Samuel Horváth , Eduard Gorbunov

Multi-Byzantine Fault Tolerant (Multi-BFT) consensus allows multiple consensus instances to run in parallel, resolving the leader bottleneck problem inherent in classic BFT consensus. However, the global ordering of Multi-BFT consensus…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-03-04 Hanzheng Lyu , Shaokang Xie , Jianyu Niu , Ivan Beschastnikh , Yinqian Zhang , Mohammad Sadoghi , Chen Feng

Verifiable Secret Sharing (VSS) has been widespread in Distributed Privacy-preserving Machine Learning (DPML), because invalid shares from malicious dealers or participants can be recognized by verifying the commitment of the received…

Cryptography and Security · Computer Science 2026-02-10 Zhen Li , Zijian Zhang , Wenjin Yang , Pengbo Wang , Zhaoqi Wang , Yan Wu , Xuyang Liu , Jing Sun

Distributed ledgers are increasingly relied upon by industry to provide trustworthy accountability, strong integrity protection, and high availability for critical data without centralizing trust. Recently, distributed append-only logs are…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-02-06 Shubham Mishra , João Gonçalves , Chawinphat Tankuranand , Neil Giridharan , Natacha Crooks , Heidi Howard , Chris Jensen

The Federated Byzantine Agreement (FBA) achieves rapid consensus by relying on overlapping quorum slices. But this architecture leads to a high dependence on the availability of validators when about one fourth of validators go down, the…

Cryptography and Security · Computer Science 2025-12-16 Erdhi Widyarto Nugroho , R. Rizal Isnanto , Luhur Bayuaji

Permissioned Blockchains are increasingly considered in enterprise use-cases, many of which do not require geo-distribution, or even disallow it due to legislation. Examples include country-wide networks, such as Alastria, or those deployed…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-07-27 Manuel Bravo , Zsolt István , Man-Kit Sit

Threshold guards are a basic primitive of many fault-tolerant algorithms that solve classical problems in distributed computing, such as reliable broadcast, two-phase commit, and consensus. Moreover, threshold guards can be found in recent…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-06-22 Igor Konnov , Marijana Lazić , Ilina Stoilkovska , Josef Widder

Modern distributed systems face growing security threats, as attackers continuously enhance their skills and vulnerabilities span across the entire system stack, from hardware to the application layer. In the system design phase, fault…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-11-07 Silvia Bonomi , Giovanni Farina , Roy Friedman , Eviatar B. Procaccia , Sebastien Tixeuil

The performance of partially synchronous BFT-based consensus protocols is highly dependent on the primary node. All participant nodes in the network are blocked until they receive a proposal from the primary node to begin the consensus…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-07-02 Mohammad M. Jalalzai , Chen Feng , Costas Busch , Golden G. Richard , Jianyu Niu

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

This paper explores the territory that lies between best-effort Byzantine-Fault-Tolerant Conflict-free Replicated Data Types (BFT CRDTs) and totally ordered distributed ledgers, such as those implemented by Blockchains. It formally…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-03-11 Davide Frey , Lucie Guillou , Michel Raynal , François Taïani

Today's practical partially synchronous Byzantine Fault Tolerant (BFT) consensus protocols trade off low latency and high throughput. On the one end, traditional BFT protocols such as PBFT and its derivatives optimize for latency. They…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-03-06 Balaji Arun , Zekun Li , Florian Suri-Payer , Sourav Das , Alexander Spiegelman

Consensus is arguably one of the most important notions in distributed computing. Among asynchronous, randomized, and signature-free implementations, the protocols of Most\'efaoui et al. (PODC 2014 and JACM 2015) represent a landmark…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-05-03 Christian Cachin , Luca Zanolini

This paper introduces MonadBFT, a novel Byzantine Fault Tolerant (BFT) consensus protocol that advances both performance and robustness. MonadBFT is implemented as the consensus protocol in the Monad blockchain. As a HotStuff-family…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-03-18 Mohammad Mussadiq Jalalzai , Kushal Babel , Jovan Komatovic , Tobias Klenze , Sourav Das , Fatima Elsheimy , Mike Setrin , John Bergschneider , Babak Gilkalaye

The success of blockchains has sparked interest in large-scale deployments of Byzantine fault tolerant (BFT) consensus protocols over wide area networks. A central feature of such networks is variable communication bandwidth across nodes…

Networking and Internet Architecture · Computer Science 2024-06-21 Lei Yang , Seo Jin Park , Mohammad Alizadeh , Sreeram Kannan , David Tse

Financial institutions are currently looking into technologies for permissioned blockchains. A major effort in this direction is Hyperledger, an open source project hosted by the Linux Foundation and backed by a consortium of over a hundred…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-06-11 Kfir Lev-Ari , Alexander Spiegelman , Idit Keidar , Dahlia Malkhi

Blockchain Sharding is a blockchain performance enhancement approach. By splitting a blockchain into several parallel-run committees (shards), it helps increase transaction throughput, reduce computational resources required, and increase…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-02-06 Yibin Xu , Jianhua Shao , Yangyu Huang , Tijs Slaats , Boris Düdder