English
Related papers

Related papers: Highway: Efficient Consensus with Flexible Finalit…

200 papers

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

Classic BFT consensus protocols guarantee safety and liveness for all clients if fewer than one-third of replicas are faulty. However, in applications such as high-value payments, some clients may want to prioritize safety over liveness.…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-12-05 Joachim Neu , Srivatsan Sridhar , Lei Yang , David Tse

It is a critical matter for a blockchain system whether a Byzantine fault tolerance (BFT) can be guaranteed during a consensus process. Can connected vehicles (CVs) achieve the BFT consensus when the vehicles keep mobile? This paper seeks…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-01-12 Seungmo Kim , Byung-Jun Kim

Motivated by proof-of-stake (PoS) blockchains such as Ethereum, two key desiderata have recently been studied for Byzantine-fault tolerant (BFT) state-machine replication (SMR) consensus protocols: Finality means that the protocol retains…

Cryptography and Security · Computer Science 2024-01-22 Joachim Neu , Ertem Nusret Tas , David Tse

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

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

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

With the advancement of blockchain systems, many recent research works have proposed distributed ledger technology~(DLT) that employs Byzantine fault-tolerant~(BFT) consensus protocols to decide which block to append next to the ledger.…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-03-21 Christian Berger , Signe Schwarz-Rüsch , Arne Vogel , Kai Bleeke , Leander Jehl , Hans P. Reiser , Rüdiger Kapitza

Distributed ledgers are common in the industry. Some of them can use blockchains as their underlying infrastructure. A blockchain requires participants to agree on its contents. This can be achieved via a consensus protocol, and several BFT…

Performance · Computer Science 2024-11-13 J. D. Chan , Y. C. Tay , Brian R. Z. Yen

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

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

Most of the Blockchain permissioned systems employ Byzantine fault-tolerance (BFT) consensus protocols to ensure that honest validators agree on the order for appending entries to their ledgers. In this paper, we study the performance and…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-10-13 Salem Alqahtani , Murat Demirbas

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

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

This paper introduces a family of leaderless Byzantine fault tolerance protocols, built around a metastable mechanism via network subsampling. These protocols provide a strong probabilistic safety guarantee in the presence of Byzantine…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-08-25 Team Rocket , Maofan Yin , Kevin Sekniqi , Robbert van Renesse , Emin Gün Sirer

This paper presents IBFT, a simple and elegant Byzantine fault-tolerant consensus algorithm that is used to implement state machine replication in the \emph{Quorum} blockchain. IBFT assumes a partially synchronous communication model, where…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-05-20 Henrique Moniz

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

Today's practical, high performance Byzantine Fault Tolerant (BFT) consensus protocols operate in the partial synchrony model. However, existing protocols are inefficient when deployments are indeed partially synchronous. They deliver…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-01-22 Neil Giridharan , Florian Suri-Payer , Ittai Abraham , Lorenzo Alvisi , Natacha Crooks

Modern high-throughput BFT consensus protocols use streamlined push-pull mechanisms to disseminate blocks and keep happy-path performance optimal. Yet state-of-the-art designs lack a principled and efficient way to exchange blocks, which…

Cryptography and Security · Computer Science 2025-11-20 Tasos Kichidis , Lefteris Kokoris-Kogias , Arun Koshy , Ilya Sergey , Alberto Sonnino , Mingwei Tian , Jianting Zhang
‹ Prev 1 2 3 10 Next ›