English
Related papers

Related papers: Carnot: A highly Scalable and Responsive BFT Conse…

200 papers

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 Federated Byzantine Agreement (FBA) achieves rapid consensus by relying on overlapping quorum slices. But this architecture leads to a high dependence on the availability of validators when about one fourth of validators go down, the…

Cryptography and Security · Computer Science 2025-12-16 Erdhi Widyarto Nugroho , R. Rizal Isnanto , Luhur Bayuaji

Permissionless blockchain technology offers numerous potential benefits for decentralised applications, such as security, transparency, and openness. BFT-based consensus mechanisms are widely adopted in the permissioned blockchain to meet…

Cryptography and Security · Computer Science 2024-07-08 Ziqiang Xu , Ahmad Salehi Shahraki , Naveen Chilamkurti

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

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

Blockchain offers a decentralized trust framework for the Internet of Things (IoT), yet deploying consensus in spectrum-congested and dynamic wireless edge IoT networks faces fundamental obstacles: traditional BFT protocols are…

Information Theory · Computer Science 2026-02-10 Taotao Wang , Long Shi , Fang Liu , Qing Yang , Shengli Zhang

Byzantine fault-tolerant systems have been researched for more than four decades, and although shown possible early, the solutions were impractical for a long time. With PBFT the first practical solution was proposed in 1999 and spawned new…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-01-13 Thomas Loruenser , Benjamin Rainer , Florian Wohner

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

Several research projects have shown that Byzantine fault tolerance (BFT) is practical today in terms of performance. Deficiencies in other aspects might still be an obstacle to a more wide-spread deployment in real-world applications. One…

Cryptography and Security · Computer Science 2012-04-12 Benedikt Höfling , Hans P. Reiser

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

This paper introduces Carbon, a high-throughput system enabling asynchronous (safe) and consensus-free (efficient) payments and votes within a dynamic set of clients. Carbon is operated by a dynamic set of validators that may be…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-08-16 Martina Camaioni , Rachid Guerraoui , Jovan Komatovic , Matteo Monti , Pierre-Louis Roman , Manuel Vidigueira , Gauthier Voron

Minimizing end-to-end latency in geo-replicated systems usually makes it necessary to compromise on resilience, resource efficiency, or throughput performance, because existing approaches either tolerate only crashes, require additional…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-07-08 Michael Eischer , Tobias Distler

Recent works have proposed new Byzantine consensus algorithms for blockchains based on epidemics, a design which enables highly scalable performance at a low cost. These methods however critically depend on a secure random peer sampling…

Cryptography and Security · Computer Science 2021-02-09 Alex Auvolat , Yérom-David Bromberg , Davide Frey , François Taïani

Today's large-scale data management systems need to address distributed applications' confidentiality and scalability requirements among a set of collaborative enterprises. This paper presents Qanaat, a scalable multi-enterprise…

Databases · Computer Science 2022-07-19 Mohammad Javad Amiri , Boon Thau Loo , Divyakant Agrawal , Amr El Abbadi

In the Bitcoin white paper, Nakamoto proposed a very simple Byzantine fault tolerant consensus algorithm that is also known as Nakamoto consensus. Despite its simplicity, some existing analysis of Nakamoto consensus appears to be long and…

Cryptography and Security · Computer Science 2019-10-22 Jianyu Niu , Chen Feng , Hoang Dau , Yu-Chih Huang , Jingge Zhu

Wireless blockchain networks have played an important role in many network scenarios, among which wireless Practical Byzantine Fault Tolerance (PBFT) consensus is regarded as one of the most important consensus mechanisms. It enables nodes…

Networking and Internet Architecture · Computer Science 2023-10-02 Haoxiang Luo , Qianqian Zhang , Hongfang Yu , Gang Sun , Shizhong Xu

In this paper, we present an efficient deterministic algorithm for consensus in presence of Byzantine failures. Our algorithm achieves consensus on an $L$-bit value with communication complexity $O(nL + n^4 L^{0.5} + n^6)$ bits, in a…

Distributed, Parallel, and Cluster Computing · Computer Science 2011-01-19 Guanfeng Liang , Nitin Vaidya

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

Partially synchronous Byzantine consensus protocols typically structure their execution into a sequence of views, each with a designated leader process. The key to guaranteeing liveness in these protocols is to ensure that all correct…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-08-11 Manuel Bravo , Gregory Chockler , Alexey Gotsman

Existing research on federated learning has been focused on the setting where learning is coordinated by a centralized entity. Yet the greatest potential of future collaborative intelligence would be unleashed in a more open and…

Cryptography and Security · Computer Science 2025-10-07 Huiwen Liu , Feida Zhu , Ling Cheng
‹ Prev 1 8 9 10 Next ›