English
Related papers

Related papers: EESMR: Energy Efficient BFT-SMR for the masses

200 papers

Byzantine fault tolerant (BFT) state machine replication (SMR) is an important building block for constructing permissioned blockchain systems. In contrast to Nakamoto Consensus where any block obtains higher assurance as buried deeper in…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-01-12 Zhuolun Xiang , Dahlia Malkhi , Kartik Nayak , Ling Ren

Recent Byzantine fault-tolerant (BFT) state machine replication (SMR) protocols increasingly focus on scalability to meet the requirements of distributed ledger technology (DLT). Validating the performance of scalable BFT protocol…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-10-02 Christian Berger , Sadok Ben Toumia , Hans P. Reiser

The novel blockchain generation of Byzantine fault-tolerant (BFT) state machine replication (SMR) protocols focuses on scalability and performance to meet requirements of distributed ledger technology (DLT), e.g., decentralization and…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-09-07 Christian Berger , Sadok Ben Toumia , Hans P. Reiser

Byzantine fault-tolerant (BFT) state machine replication (SMR) has been studied for over 30 years. Recently it has received more attention due to its application in permissioned blockchain systems. A sequence of research efforts focuses on…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-05-03 Ittai Abraham , Kartik Nayak , Ling Ren , Zhuolun Xiang

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

In this paper, we present Raptr--a Byzantine fault-tolerant state machine replication (BFT SMR) protocol that combines strong robustness with high throughput, while attaining near-optimal theoretical latency. Raptr delivers exceptionally…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-04-30 Andrei Tonkikh , Balaji Arun , Zhuolun Xiang , Zekun Li , Alexander Spiegelman

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

Despite years of intensive research, Byzantine fault-tolerant (BFT) systems have not yet been adopted in practice. This is due to additional cost of BFT in terms of resources, protocol complexity and performance, compared with crash…

Distributed, Parallel, and Cluster Computing · Computer Science 2016-11-09 Shengyun Liu , Paolo Viotti , Christian Cachin , Vivien Quéma , Marko Vukolić

Practical Byzantine Fault Tolerance (PBFT) is a seminal state machine replication protocol that achieves a performance comparable to non-replicated systems in realistic environments. A reason for such high performance is the set of…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-07-26 Christian Berger , Hans P. Reiser , Alysson Bessani

Existing chain-based rotating-leader BFT SMR protocols for the partially synchronous network model with constant commit latencies incur block periods of at least $2\delta$ (where $\delta$ is the message transmission latency). While a…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-04-22 Isaac Doidge , Raghavendra Ramesh , Nibesh Shrestha , Joshua Tobkin

Blockchain technology sparked renewed interest in planetary-scale Byzantine fault-tolerant (BFT) state machine replication (SMR). While recent works predominantly focused on improving the scalability and throughput of these protocols, few…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-10-01 Christian Berger , Lívio Rodrigues , Hans P. Reiser , Vinicius Cogo , Alysson Bessani

Distributed Software Defined Networking (SDN) controllers aim to solve the issue of single-point-of-failure and improve the scalability of the control plane. Byzantine and faulty controllers, however, may enforce incorrect configurations…

Networking and Internet Architecture · Computer Science 2019-02-25 Ermin Sakic , Wolfgang Kellerer

Byzantine state-machine replication (SMR) ensures the consistency of replicated state in the presence of malicious replicas and lies at the heart of the modern blockchain technology. Byzantine SMR protocols often guarantee safety under all…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-10-06 Manuel Bravo , Gregory Chockler , Alexey Gotsman

At PODC 2014, A. Most\'efaoui, H. Moumen, and M. Raynal presented a new and simple randomized signature-free binary consensus algorithm (denoted here MMR) that copes with the net effect of asynchrony Byzantine behaviors. Assuming message…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-01-24 Chryssis Georgiou , Ioannis Marcoullis , Michel Raynal , Elad Michael Schiller

The popularity of permissioned blockchain systems demands BFT SMR protocols that are efficient under good network conditions (synchrony) and robust under bad network conditions (asynchrony). The state-of-the-art partially synchronous BFT…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-03-05 Rati Gelashvili , Lefteris Kokoris-Kogias , Alexander Spiegelman , Zhuolun Xiang

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

Permissioned blockchains employ Byzantine fault-tolerant (BFT) state machine replication (SMR) to reach agreement on an ever-growing, linearly ordered log of transactions. A new paradigm, combined with decades of research in BFT SMR and…

Cryptography and Security · Computer Science 2021-03-02 Fangyu Gai , Ali Farahbakhsh , Jianyu Niu , Chen Feng , Ivan Beschastnikh , Hao Duan

This paper presents Banyan, the first rotating leader state machine replication (SMR) protocol that allows transactions to be confirmed in just a single round-trip time in the Byzantine fault tolerance (BFT) setting. Based on minimal…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-12-12 Yann Vonlanthen , Jakub Sliwinski , Massimo Albarello , Roger Wattenhofer

The view synchronization problem lies at the heart of many Byzantine Fault Tolerant (BFT) State Machine Replication (SMR) protocols in the partial synchrony model, since these protocols are usually based on views. Liveness is guaranteed if…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-03-19 Andrew Lewis-Pye , Dahlia Malkhi , Oded Naor , Kartik Nayak

We introduce FnF-BFT, a parallel-leader byzantine fault-tolerant state-machine replication protocol for the partially synchronous model with theoretical performance bounds during synchrony. By allowing all replicas to act as leaders and…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-03-11 Zeta Avarikioti , Lioba Heimbach , Roland Schmid , Laurent Vanbever , Roger Wattenhofer , Patrick Wintermeyer
‹ Prev 1 2 3 10 Next ›