English
Related papers

Related papers: Reaching Consensus in the Byzantine Empire: A Comp…

200 papers

We present Blizzard, a Byzantine Fault Tolerant (BFT) distributed ledger protocol that is aimed at making mobile devices first-class citizens in the consensus process. Blizzard introduces a novel two-tier architecture by having the mobile…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-01-07 Mehrdad Kiamari , Bhaskar Krishnamachari , Muhammad Naveed , Seokgu Yun

Byzantine Fault-Tolerant (BFT) protocols play an important role in blockchains. As the deployment of such systems extends to wide-area networks, the scalability of BFT protocols becomes a critical concern. Optimizations that assign specific…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-11-10 Hanish Gogada , Christian Berger , Leander Jehl , Hans P. Reiser , Hein Meling

Blockchain systems benefit from lessons in prior art such as fault tolerance, distributed systems, peer-to-peer systems, and game theory. In this paper we argue that blockchain algorithms should tolerate both rational (self-interested)…

Distributed, Parallel, and Cluster Computing · Computer Science 2018-11-05 Jean-Philippe Martin , Eunjin , Jung

Byzantine agreement, the underlying core of blockchain, aims to make every node in a decentralized network reach consensus. Classical Byzantine agreements unavoidably face two major problems. One is $1/3$ fault-tolerance bound, which means…

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

We present ezBFT, a novel leaderless, distributed consensus protocol capable of tolerating byzantine faults. ezBFT's main goal is to minimize the client-side latency in WAN deployments. It achieves this by (i) having no designated primary…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-04-15 Balaji Arun , Sebastiano Peluso , Binoy Ravindran

In this paper, we present a Byzantine fault tolerant distributed commit protocol for transactions running over untrusted networks. The traditional two-phase commit protocol is enhanced by replicating the coordinator and by running a…

Distributed, Parallel, and Cluster Computing · Computer Science 2016-11-17 Wenbing Zhao

Quantum key distribution (QKD) networks is expected to provide information-theoretical secured (ITS) communication over long distances. QKD networks based trusted relay architecture are now the most widely used scheme in practice. However,…

Quantum Physics · Physics 2022-04-22 Yi Luo , Hao-Kun Mao , Qiong Li

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

A blockchain is a distributed ledger for recording transactions, maintained by many nodes without central authority through a distributed cryptographic protocol. All nodes validate the information to be appended to the blockchain, and a…

Distributed, Parallel, and Cluster Computing · Computer Science 2017-07-10 Christian Cachin , Marko Vukolić

Byzantine Fault-Tolerant (BFT) protocols have been proposed to tolerate malicious behaviors in state machine replications. With classic BFT protocols, the total number of replicas is known and fixed a priori. The resilience of BFT…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-06-12 Jiangshan Yu

Achieving agreement among distributed parties is a fundamental task in modern systems, underpinning applications such as consensus in blockchains, coordination in cloud infrastructure, and fault tolerance in critical services. However, this…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-02-18 Andrei Constantinescu , Marc Dufay , Anton Paramonov , Roger Wattenhofer

The ability to perform repeated Byzantine agreement lies at the heart of important applications such as blockchain price oracles or replicated state machines. Any such protocol requires the following properties: (1) \textit{Byzantine…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-06-17 Shlomi Dolev , Amit Hendin , Maurice Herlihy , Maria Potop Butucaru , Elad Michael Schiller

Numerous distributed tasks have to be handled in a setting where a fraction of nodes behaves Byzantine, that is, deviates arbitrarily from the intended protocol. Resilient, deterministic protocols rely on the detection of majorities to…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-02-10 Philipp Schneider

In recent years, blockchain technology has received unparalleled attention from academia, industry, and governments all around the world. It is considered a technological breakthrough anticipated to disrupt several application domains. This…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-02-10 Md Sadek Ferdous , Mohammad Jabed Morshed Chowdhury , Mohammad A. Hoque , Alan Colman

We present a solution to consensus on a torus with Byzantine faults. Any solution to classic consensus that is tolerant to $f$ Byzantine faults requires $2f+1$ node-disjoint paths. Due to limited torus connectivity, this bound necessitates…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-08-10 Joseph Oglio , Kendric Hood , Gokarna Sharma , Mikhail Nesterenko

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

Tetris is an Asynchronous Byzantine Fault Tolerance consensus algorithm designed for next generation high-throughput permission and permissionless blockchain. The core concept of Tetris is derived from Reasoning About Knowledge, which we…

Multiagent Systems · Computer Science 2018-12-11 Jiajun Xu , Sam Huang

Consensus protocols play a pivotal role to balance security and efficiency in blockchain systems. In this paper, we propose an evaluation framework for blockchain consensus protocols termed as AlphaBlock. In this framework, we compare the…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-07-28 Haitao Xiang , Zhijie Ren , Ziheng Zhou , Ning Wang , Hanqing Jin

In this report, building on the deterministic multi-valued one-to-many Byzantine agreement (broadcast) algorithm in our recent technical report [2], we introduce a deterministic multi-valued all-to-all Byzantine agreement algorithm…

Distributed, Parallel, and Cluster Computing · Computer Science 2010-08-27 Guanfeng Liang , Nitin Vaidya
‹ Prev 1 4 5 6 7 8 10 Next ›