English
Related papers

Related papers: Knowledge Connectivity Requirements for Solving BF…

200 papers

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

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

We present Egalitarian BFT (EBFT), a simple and high-performance framework of BFT consensus protocols for decentralized systems like blockchains. The key innovation in EBFT is egalitarian block generation: nodes randomly and…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-03-14 Jianyu Niu , Runchao Han , Shengqi Liu , Fangyu Gai , Ivan Beschastnikh , Yinqian Zhang , Chen Feng

Recent Byzantine fault-tolerant (BFT) state machine replication (SMR) protocols increasingly focus on scalability to meet the requirements of distributed ledger technology (DLT). Validating the performance of scalable BFT protocol…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-10-02 Christian Berger , Sadok Ben Toumia , Hans P. Reiser

A recent paper by Gupta et al. (EuroSys'23) challenged the usefulness of trusted component (TC) based Byzantine fault-tolerant (BFT) protocols to lower the replica group size from $3f+1$ to $2f+1$, identifying three limitations of such…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-12-12 Alysson Bessani , Miguel Correia , Tobias Distler , Rüdiger Kapitza , Paulo Esteves-Verissimo , Jiangshan Yu

We consider the problem of reaching consensus in communication networks that are modeled by directed graphs. We assume the existence of a message authentication mechanism (such as digital signatures) to verify the integrity of messages. We…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-05-13 Nitin H. Vaidya , Lewis Tseng

We address the problem of reaching consensus in the presence of Byzantine faults. In particular, we are interested in investigating the impact of messages relay on the network connectivity for a correct iterative approximate Byzantine…

Distributed, Parallel, and Cluster Computing · Computer Science 2015-04-17 Lili Su , Nitin Vaidya

The security foundation of blockchain system relies primarily on classical cryptographic methods and consensus algorithms. However, the advent of quantum computing poses a significant threat to conventional public-key cryptosystems based on…

Cryptography and Security · Computer Science 2026-02-13 Fei Xu , Cheng Ye , Jie OuYang , Ziqiang Wu , Haoze Chen , An Hua , Meifeng Gao , Qiandong Zhang , Minghan Li , Feilong Li , Yajun Miao , Wei Qi

Consensus is becoming increasingly important in wireless networks. Partially synchronous BFT consensus, a significant branch of consensus, has made considerable progress in wired networks. However, its implementation in wireless networks,…

Networking and Internet Architecture · Computer Science 2024-12-10 Shuo Liu , Minghui Xu , Yuezhou Zheng , Yifei Zou , Wangjie Qiu , Gang Qu , Xiuzhen Cheng

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

SURFACE, standing for Secure, Use-case adaptive, and Relatively Fork-free Approach of Chain Extension, is a consensus algorithm that is designed for real-world networks and enjoys the benefits from both the Nakamoto consensus and Byzantine…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-08-17 Zhijie Ren , Ziheng Zhou

Blockchain systems need to solve consensus despite the presence of rational users and failures. The notion of $(k,t)$-robustness has shown instrumental to list problems that cannot be solved if $k$ players are rational and $t$ players are…

Computer Science and Game Theory · Computer Science 2021-11-03 Alejandro Ranchal-Pedrosa , Vincent Gramoli

Distributed algorithms solving agreement problems like consensus or state machine replication are essential components of modern fault-tolerant distributed services. They are also notoriously hard to understand and reason about. Their…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-01-25 Berk Cirisci , Constantin Enea , Suha Orhun Mutluergil

Modern edge applications demand novel solutions where edge applications do not have to rely on a single cloud provider (which cannot be in the vicinity of every edge device) or dedicated edge servers (which cannot scale as clouds) for…

Databases · Computer Science 2022-08-30 Suyash Gupta , Sajjad Rahnama , Erik Linsenmayer , Faisal Nawab , Mohammad Sadoghi

Blockchain technology has revolutionized the digital landscape, driving innovations across industries through its decentralized and transparent infrastructure. These networks are primarily categorized as public or private, based on user…

Cryptography and Security · Computer Science 2026-03-10 Mohammad Pishdar , Jawad Manzoor

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

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

This paper explores the problem of reaching approximate consensus in synchronous point-to-point networks, where each pair of nodes is able to communicate with each other directly and reliably. We consider the mobile Byzantine fault model…

Distributed, Parallel, and Cluster Computing · Computer Science 2017-07-25 Lewis Tseng

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 technologies originate from cryptocurrencies. Thus, most blockchain technologies assume an environment with a fast and stable network. However, in some blockchain-based systems, e.g., supply chain management (SCM) systems, some…