English
Related papers

Related papers: Formally Verifying the Safety of Pipelined Moonsho…

200 papers

Existing Byzantine fault-tolerant (BFT) consensus protocols address only threshold failures, where the participating nodes fail independently of each other, each one fails equally likely, and the protocol's guarantees follow from a simple…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-08-04 Orestis Alpos , Christian Cachin

Decentralized finance (DeFi) has become one of the most successful applications of blockchain and smart contracts. The DeFi ecosystem enables a wide range of crypto-financial activities, while the underlying smart contracts often contain…

Cryptography and Security · Computer Science 2021-04-20 Palina Tolmach , Yi Li , Shang-Wei Lin , Yang Liu

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

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

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) protocols allow a group of replicas to come to a consensus even when some of the replicas are Byzantine faulty. There exist multiple BFT protocols to securely tolerate an optimal number of faults $t$ under…

Cryptography and Security · Computer Science 2021-11-09 Peiyao Sheng , Gerui Wang , Kartik Nayak , Sreeram Kannan , Pramod Viswanath

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

To implement a blockchain, the trend is now to integrate a non-trivial Byzantine fault tolerant consensus algorithm instead of the seminal idea of waiting to receive blocks to decide upon the longest branch. After a decade of existence,…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-10-16 Pierre Tholoniat , Vincent Gramoli

We present a measurement study on compositions of Decentralized Finance protocols, which aim to disrupt traditional finance and offer services on top of distributed ledgers, such as Ethereum. DeFi compositions may impact the development of…

Cryptography and Security · Computer Science 2022-10-03 Stefan Kitzler , Friedhelm Victor , Pietro Saggese , Bernhard Haslhofer

Tendermint-core blockchains (e.g. Cosmos) are considered today one of the most viable alternatives for the highly energy consuming proof-of-work blockchains such as Bitcoin and Ethereum. Their particularity is that they aim at offering…

Distributed, Parallel, and Cluster Computing · Computer Science 2018-12-14 Yackolley Amoussou-Guenou , Antonella Del Pozzo , Maria Potop-Butucaru , Sara Tucci-Piergiovanni

The decentralized cryptocurrency Bitcoin has experienced great success but also encountered many challenges. One of the challenges has been the long confirmation time. Another challenge is the lack of incentives at certain steps of the…

Cryptography and Security · Computer Science 2017-11-21 Ittai Abraham , Dahlia Malkhi , Kartik Nayak , Ling Ren , Alexander Spiegelman

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

The popularization of blockchains leads to a resurgence of interest in Byzantine Fault-Tolerant (BFT) state machine replication protocols. However, much of the work on this topic focuses on the underlying consensus protocols, with emphasis…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-05-01 Alysson Bessani , Eduardo Alchieri , João Sousa , André Oliveira , Fernando Pedone

The recent surge in federated data management applications has brought forth concerns about the security of underlying data and the consistency of replicas in the presence of malicious attacks. A prominent solution in this direction is to…

Databases · Computer Science 2022-03-25 Sajjad Rahnama , Suyash Gupta , Rohan Sogani , Dhruv Krishnan , Mohammad Sadoghi

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

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

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

Since the inception of permissionless blockchains with Bitcoin in 2008, it became apparent that their most well-suited use case is related to making the financial system and its advantages available to everyone seamlessly without depending…

General Finance · Quantitative Finance 2023-06-16 Georgios Palaiokrassas , Sandro Scherrers , Iason Ofeidis , Leandros Tassiulas

The practical Byzantine fault tolerant (PBFT) consensus protocol is one of the basic consensus protocols in the development of blockchain technology. At the same time, the PBFT consensus protocol forms a basis for some other important BFT…

Performance · Computer Science 2023-06-21 Yan-Xia Chang , Qing Wang , Quan-Lin Li , Yaqian Ma
‹ Prev 1 2 3 10 Next ›