English
Related papers

Related papers: Falcon: Advancing Asynchronous BFT Consensus for L…

200 papers

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

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

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

Vote-based blockchains construct a state machine replication (SMR) system among participating nodes, using Byzantine Fault Tolerance (BFT) consensus protocols to transition from one state to another. Currently, they rely on either…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-12-25 Yibin Xu , Jianhua Shao , Tijs Slaats , Boris Düdder , Yongluan Zhou

Low latency is one of the desired properties for partially synchronous Byzantine consensus protocols. Previous protocols have achieved consensus with just two communication steps either by reducing the bound on the number of faults the…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-10-12 Mohammad M. Jalalzai , Chen Feng , Victoria Lemieux

Byzantine Fault Tolerant (BFT) consensus exhibits higher throughput in comparison to Proof of Work (PoW) in blockchains. But BFT-based protocols suffer from scalability problems with respect to the number of replicas in the network. The…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-04-30 Mohammad M. Jalalzai , Costas Busch , Golden Richard

The surging interest in blockchain technology has revitalized the search for effective Byzantine consensus schemes. In particular, the blockchain community has been looking for ways to effectively integrate traditional Byzantine…

Cryptography and Security · Computer Science 2018-11-15 Jian Liu , Wenting Li , Ghassan O. Karame , N. Asokan

In this paper we present an open source, fully asynchronous, leaderless algorithm for reaching consensus in the presence of Byzantine faults in an asynchronous network. We prove the algorithm's correctness provided that less than a third of…

Cryptography and Security · Computer Science 2019-07-29 Pierre Chevalier , Bartlomiej Kaminski , Fraser Hutchison , Qi Ma , Spandan Sharma , Andreas Fackler , William J Buchanan

Traditional Byzantine Fault Tolerance (BFT) state machine replication protocols assume a partial synchrony model, leading to a design where a leader replica drives the protocol and is replaced after a timeout. Recently, we witnessed a surge…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-07-23 Diogo S. Antunes , Afonso N. Oliveira , André Breda , Matheus Guilherme Franco , Henrique Moniz , Rodrigo Rodrigues

Byzantine Fault Tolerant (BFT) consensus forms the foundation of many modern blockchains striving for both high throughput and low latency. A growing bottleneck is transaction execution and validation on the critical path of consensus,…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-02-25 Ignacio Amores-Sesar , Mirza Ahad Baig , Seth Gilbert , Ray Neiheiser , Michelle X. Yeo

The spectacular success of Bitcoin and Blockchain Technology in recent years has provided enough evidence that a widespread adoption of a common cryptocurrency system is not merely a distant vision, but a scenario that might come true in…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-08-30 Adam Gągol , Damian Leśniak , Damian Straszak , Michał Świętek

Byzantine fault-tolerant (BFT) consensus algorithms are at the core of providing safety and liveness guarantees for distributed systems that must operate in the presence of arbitrary failures. Recently, numerous new BFT algorithms have been…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-12-06 Gengrui Zhang , Fei Pan , Yunhao Mao , Sofia Tijanic , Michael Dang'ana , Shashank Motepalli , Shiquan Zhang , Hans-Arno Jacobsen

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

This paper presents TetraBFT, a novel unauthenticated Byzantine fault tolerant protocol for solving consensus in partial synchrony, eliminating the need for public key cryptography and ensuring resilience against computationally unbounded…

Cryptography and Security · Computer Science 2026-04-14 Qianyu Yu , Giuliano Losa , Xuechao Wang

Traditional Byzantine Fault Tolerance (BFT) state machine replication protocols assume a partial synchrony model, leading to a design where a leader replica drives the protocol and is replaced after a timeout. Recently, we witnessed a surge…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-02-07 Afonso Oliveira , Henrique Moniz , Rodrigo Rodrigues

An urgent demand of deploying BFT consensus over the Internet is raised for implementing blockchain services. The deterministic (partial) synchronous protocols can be simple and fast in good network conditions, but are subject to…

Cryptography and Security · Computer Science 2022-09-02 Yuan Lu , Zhenliang Lu , Qiang Tang

Byzantine fault tolerance (BFT) consensus is a fundamental primitive for distributed computation. However, BFT protocols suffer from the ordering manipulation, in which an adversary can make front-running. Several protocols are proposed to…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-09-20 Guangren Wang , Liang Cai , Fangyu Gai , Jianyu Niu

Byzantine fault-tolerant (BFT) web services provide critical integrity guarantees for distributed applications but face significant latency challenges that hinder interactive user experiences. We propose a novel two-layer architecture that…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-07-14 Ahmad Zaki Akmal , Azkario Rizky Pratama , Guntur Dharma Putra

Consensus protocols play a pivotal role to balance security and efficiency in blockchain systems. In this paper, we propose an evaluation framework for blockchain consensus protocols termed as AlphaBlock. In this framework, we compare the…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-07-28 Haitao Xiang , Zhijie Ren , Ziheng Zhou , Ning Wang , Hanqing Jin

With the advancement of blockchain technology, chained Byzantine Fault Tolerant (BFT) protocols have been increasingly adopted in practical systems, making their performance a crucial aspect of the study. In this paper, we introduce a…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-01-08 Yining Tang , Qihang Luo , Runchao Han , Jianyu Niu , Chen Feng , Yinqian Zhang
‹ Prev 1 2 3 10 Next ›