English
Related papers

Related papers: Validated Strong Consensus Protocol for Asynchrono…

200 papers

With the rapid development of blockchain, Byzantine fault-tolerant protocols have attracted revived interest recently. To overcome the theoretical bounds of Byzantine fault tolerance, many protocols attempt to use Trusted Execution…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-07-07 Jiashuo Zhang , Jianbo Gao , Ke Wang , Zhenhao Wu , Ying Lan , Zhi Guan , Zhong Chen

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

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

With the growing commercial interest in blockchain, permissioned implementations have received increasing attention. Unfortunately, existing BFT consensus protocols that are the backbone of permissioned blockchains, either scale poorly or…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-03-24 Ray Neiheiser , Miguel Matos , Luís Rodrigues

The concept of distributed consensus originated in the 1970s and gained widespread attention following Leslie Lamport's influential publication on the Byzantine Generals Problem in the 1980s. Over the past five decades, distributed…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-05-13 Huanyu Wu , Chentao Yue , Yixuan Fan , Yonghui Li , Lei Zhang

This paper presents LinBFT, a novel Byzantine fault tolerance (BFT) protocol for blockchain systems that achieves amortized O(n) communication volume per block under reasonable conditions (where n is the number of participants), while…

Cryptography and Security · Computer Science 2018-07-06 Yin Yang

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

Consensus in decentralized systems that asynchronously receive events and which are subject to Byzantine faults is a common problem with many real-life applications. Advances in decentralized systems, such as distributed ledger (i.e.,…

Distributed, Parallel, and Cluster Computing · Computer Science 2018-09-05 Fedor Muratov , Andrei Lebedev , Nikolai Iushkevich , Bulat Nasrulin , Makoto Takemiya

The rapid evolution of Internet of Things (IoT) environments has created an urgent need for secure and trustworthy distributed computing systems, particularly when dealing with heterogeneous devices and applications where centralized trust…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-05-02 Murtaza Rangwala , Rajkumar Buyya

Byzantine fault tolerance (BFT) can preserve the availability and integrity of IoT systems where single components may suffer from random data corruption or attacks that can expose them to malicious behavior. While state-of-the-art BFT…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-07-07 Christian Berger , Hans P. Reiser , Franz J. Hauck , Florian Held , Jörg Domaschka

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

This paper presents DuoBFT, a Byzantine fault-tolerant protocol that uses trusted components to provide commit decisions in the Hybrid fault model in addition to commit decisions in the BFT model. By doing so, it enables the clients to…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-02-09 Balaji Arun , Binoy Ravindran

Byzantine fault tolerant protocols enable state replication in the presence of crashed, malfunctioning, or actively malicious processes. Designing such protocols without the assistance of verification tools, however, is remarkably…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-09-23 Joel Wanner , Laurent Chuat , Adrian Perrig

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

Hyperledger Fabric is an enterprise grade permissioned distributed ledger platform that offers modularity for a broad set of industry use cases. One modular component is a pluggable ordering service that establishes consensus on the order…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-07-16 Artem Barger , Yacov Manevich , Hagar Meir , Yoav Tock

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

The performance of partially synchronous BFT-based consensus protocols is highly dependent on the primary node. All participant nodes in the network are blocked until they receive a proposal from the primary node to begin the consensus…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-07-02 Mohammad M. Jalalzai , Chen Feng , Costas Busch , Golden G. Richard , Jianyu Niu

Parallel Byzantine Fault Tolerant (BFT) protocols based on committee-based sharding improve scalability but weaken safety since smaller node groups are responsible for consensus. Recent approaches integrate trusted execution environments…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-03-17 Yifei Xie , Btissam Er-Rahmadi , Xiao Chen , Tiejun Ma , Jane Hillston

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

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ć
‹ Prev 1 4 5 6 7 8 10 Next ›