English
Related papers

Related papers: The Hermes BFT for Blockchains

200 papers

Modern chained Byzantine Fault Tolerant (BFT) systems leverage a combination of pipelining and leader rotation to obtain both efficiency and fairness. These protocols, however, require a sequence of three or four consecutive honest leaders…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-01-27 Ittai Abraham , Natacha Crooks , Neil Giridharan , Heidi Howard , Florian Suri-Payer

Reconfiguration of long-lived blockchain and Byzantine fault-tolerant (BFT) systems poses fundamental security challenges. In case of state-of-the-art Proof-of-Stake (PoS) blockchains, stake reconfiguration enables so-called long-range…

Cryptography and Security · Computer Science 2021-09-10 Selma Steinhoff , Chrysoula Stathakopoulou , Matej Pavlovic , Marko Vukolić

The blockchain technology has achieved tremendous success in open (permissionless) decentralized consensus by employing proof-of-work (PoW) or its variants, whereby unauthorized nodes cannot gain disproportionate impact on consensus beyond…

Information Theory · Computer Science 2018-03-26 Zhiyuan Jiang , Bhaskar Krishnamachari , Sheng Zhou , Zhisheng Niu

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

Consensus is one of the most fundamental distributed computing problems. In particular, it serves as a building block in many replication based fault-tolerant systems and in particular in multiple recent blockchain solutions. Depending on…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-08-08 Yehonatan Buchnik , Roy Friedman

The problem of Byzantine consensus has been key to designing secure distributed systems. However, it is particularly difficult, mainly due to the presence of Byzantine processes that act arbitrarily and the unknown message delays in general…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-05-05 Alejandro Ranchal-Pedrosa , Vincent Gramoli

In this paper we analyze Tendermint proposed in [7], one of the most popular blockchains based on PBFT Consensus. The current paper dissects Tendermint under various system communication models and Byzantine adversaries. Our methodology…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-07-31 Yackolley Amoussou-Guenou , Antonella del Pozzo , Maria Potop-Butucaru , Sara Tucci-Piergiovanni

Scalability is a common issue among the most used permissionless blockchains, and several approaches have been proposed to solve this issue. Tackling scalability while preserving the security and decentralization of the network is a…

Cryptography and Security · Computer Science 2023-11-10 Mikel Cortes-Goicoechea , Tarun Mohandas-Daryanani , Jose L. Muñoz-Tapia , Leonardo Bautista-Gomez

Blockchains implement decentralized monetary systems and applications. Recent advancements enable what we call tethering a blockchain to a primary blockchain, securing the tethered chain by nodes that post primary-chain tokens as…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-04-25 Yogev Bar-On , Roi Bar-Zur , Omer Ben-Porat , Nimrod Cohen , Ittay Eyal , Matan Sitbon

It is a common belief that Byzantine fault-tolerant solutions for consensus are significantly slower than their crash fault-tolerant counterparts. Indeed, in PBFT, the most widely known Byzantine fault-tolerant consensus protocol, it takes…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-07-28 Petr Kuznetsov , Andrei Tonkikh , Yan X Zhang

Mission critical systems deployed in data centers today are facing more sophisticated failures. Byzantine fault tolerant (BFT) protocols are capable of masking these types of failures, but are rarely deployed due to their performance cost…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-10-25 Guangda Sun , Xin Zhe Khooi , Yunfan Li , Mingliang Jiang , Jialin Li

Bitcoin is the first fully-decentralized permissionless blockchain protocol to achieve a high level of security, but at the expense of poor throughput and latency. Scaling the performance of Bitcoin has a been a major recent direction of…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-02-20 Lei Yang , Xuechao Wang , Vivek Bagaria , Gerui Wang , Mohammad Alizadeh , David Tse , Giulia Fanti , Pramod Viswanath

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

State-of-the-art asynchronous Byzantine fault-tolerant (BFT) protocols, such as HoneyBadgerBFT, BEAT, and Dumbo, have shown a performance comparable to partially synchronous BFT protocols. This paper studies two practical directions in…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-08-24 Chao Liu , Sisi Duan , Haibin Zhang

This paper presents a novel leaderless protocol (FPC-BI: Fast Probabilistic Consensus within Byzantine Infrastructures) with a low communicational complexity and which allows a set of nodes to come to a consensus on a value of a single bit.…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-09-15 Serguei Popov , William J Buchanan

Distributed Computing in Blockchain Technology (BCT) hinges on a trust assumption among independent nodes. Without a third-party interface or what is known as a Blockchain Oracle, it can not interact with the external world. This Oracle…

Cryptography and Security · Computer Science 2024-01-02 Fahad Rahman , Chafiq Titouna , Farid Nait-Abdesselam

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

This paper introduces Flexible BFT, a new approach for BFT consensus solution design revolving around two pillars, stronger resilience and diversity. The first pillar, stronger resilience, involves a new fault model called alive-but-corrupt…

Cryptography and Security · Computer Science 2019-06-03 Dahlia Malkhi , Kartik Nayak , Ling Ren

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

In May 2023, the Ethereum blockchain experienced its first inactivity leak, a mechanism designed to reinstate chain finalization amid persistent network disruptions. This mechanism aims to reduce the voting power of validators who are…

Cryptography and Security · Computer Science 2024-06-07 Ulysse Pavloff , Yackolley Amoussou-Genou , Sara Tucci-Piergiovanni
‹ Prev 1 4 5 6 7 8 10 Next ›