English
Related papers

Related papers: Gosig: Scalable Byzantine Consensus on Adversarial…

200 papers

This paper presents Mir-BFT, a robust Byzantine fault-tolerant (BFT) total order broadcast protocol aimed at maximizing throughput on wide-area networks (WANs), targeting deployments in decentralized networks, such as permissioned and…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-01-25 Chrysoula Stathakopoulou , Tudor David , Matej Pavlovic , Marko Vukolić

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

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

With the rapid development of blockchain and its applications, the amount of data stored on decentralized storage networks (DSNs) has grown exponentially. DSNs bring together affordable storage resources from around the world to provide…

Cryptography and Security · Computer Science 2024-02-21 Hechuan Guo , Minghui Xu , Jiahao Zhang , Chunchi Liu , Rajiv Ranjan , Dongxiao Yu , Xiuzhen Cheng

The parallel Byzantine Fault Tolerant (BFT) protocol is viewed as a promising solution to address the consensus scalability issue of the permissioned blockchain. One of the main challenges in parallel BFT is the view change process that…

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

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

Byzantine fault-tolerant (BFT) systems are able to maintain the availability and integrity of IoT systems, in presence of failure of individual components, random data corruption or malicious attacks. Fault-tolerant systems in general are…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-09-06 Marco Marcozzi , Orhan Gemikonakli , Eser Gemikonakli , Enver Ever , Leonardo Mostarda

For applications of Byzantine fault tolerant (BFT) consensus protocols where the participants are economic agents, recent works highlighted the importance of accountability: the ability to identify participants who provably violate the…

Cryptography and Security · Computer Science 2022-05-19 Joachim Neu , Ertem Nusret Tas , David Tse

Fault-tolerant consensus has been studied extensively in the literature, because it is one of the most important distributed primitives and has wide applications in practice. This paper surveys important results on fault-tolerant consensus…

Distributed, Parallel, and Cluster Computing · Computer Science 2016-08-30 Lewis Tseng

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

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

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

This paper describes a simple and efficient asynchronous Binary Byzantine faulty tolerant consensus algorithm. In the algorithm, non-faulty nodes perform an initial broadcast followed by a executing a series of rounds each consisting of a…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-02-12 Tyler Crain

Today's practical partially synchronous Byzantine Fault Tolerant (BFT) consensus protocols trade off low latency and high throughput. On the one end, traditional BFT protocols such as PBFT and its derivatives optimize for latency. They…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-03-06 Balaji Arun , Zekun Li , Florian Suri-Payer , Sourav Das , Alexander Spiegelman

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

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

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

Ensuring that an AI system behaves reliably and as intended, especially in the presence of unexpected faults or adversarial conditions, is a complex challenge. Inspired by the field of Byzantine Fault Tolerance (BFT) from distributed…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-04-30 John deVadoss , Matthias Artzt

Blockchain technology has advanced rapidly in recent years and is now widely used in a variety of fields. Blockchain appears to be one of the best solutions for managing massive heterogeneous devices while achieving advanced data security…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-08-05 Xu Yuan , Fang Luo , Muhammad Zeeshan Haider , Zhikui Chen , Yucheng Li

This paper presents TetraBFT, a novel unauthenticated Byzantine fault tolerant protocol for solving consensus in partial synchrony, eliminating the need for public key cryptography and ensuring resilience against computationally unbounded…

Cryptography and Security · Computer Science 2026-04-14 Qianyu Yu , Giuliano Losa , Xuechao Wang
‹ Prev 1 3 4 5 6 7 10 Next ›