English
Related papers

Related papers: The Istanbul BFT Consensus Algorithm

200 papers

The novel blockchain generation of Byzantine fault-tolerant (BFT) state machine replication (SMR) protocols focuses on scalability and performance to meet requirements of distributed ledger technology (DLT), e.g., decentralization and…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-09-07 Christian Berger , Sadok Ben Toumia , Hans P. Reiser

Byzantine Fault Tolerant (BFT) consensus exhibits higher throughput in comparison to Proof of Work (PoW) in blockchains. But BFT-based protocols suffer from scalability problems with respect to the number of replicas in the network. The…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-04-30 Mohammad M. Jalalzai , Costas Busch , Golden Richard

Practical Byzantine Fault Tolerance (PBFT) is a seminal state machine replication protocol that achieves a performance comparable to non-replicated systems in realistic environments. A reason for such high performance is the set of…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-07-26 Christian Berger , Hans P. Reiser , Alysson Bessani

Blockchain technology has been proposed as a new infrastructure technology for a wide variety of novel applications. Blockchains provide an immutable record of transactions, making them useful when business actors do not trust each other.…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-08-27 Joerg Evermann , Henry Kim

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

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

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-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

Large Language Models (LLMs) have achieved remarkable success across a wide range of applications. However, individual LLMs often produce inconsistent, biased, or hallucinated outputs due to limitations in their training corpora and model…

Cryptography and Security · Computer Science 2025-05-09 Haoxiang Luo , Gang Sun , Yinqiu Liu , Dongcheng Zhao , Dusit Niyato , Hongfang Yu , Schahram Dustdar

Asynchronous Byzantine fault-tolerant (BFT) consensus protocols, known for their robustness in unpredictable environments without relying on timing assumptions, are becoming increasingly vital for wireless applications. While these…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-04-08 Shuo Liu , Minghui Xu , Tianyi Sun , Xiuzhen Cheng

This paper describes a simple and efficient Binary Byzantine faulty tolerant consensus algorithm using a weak round coordinator and the partial synchrony assumption to ensure liveness. In the algorithm, non-faulty nodes perform an initial…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-01-23 Tyler Crain

This paper introduces a family of leaderless Byzantine fault tolerance protocols, built around a metastable mechanism via network subsampling. These protocols provide a strong probabilistic safety guarantee in the presence of Byzantine…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-08-25 Team Rocket , Maofan Yin , Kevin Sekniqi , Robbert van Renesse , Emin Gün Sirer

Byzantine Fault Tolerant (BFT) systems are considered by the systems research community to be state of the art with regards to providing reliability in distributed systems. BFT systems provide safety and liveness guarantees with reasonable…

Distributed, Parallel, and Cluster Computing · Computer Science 2011-10-24 Nikos Chondros , Konstantinos Kokordelis , Mema Roussopoulos

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

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

Byzantine Fault Tolerant (BFT) consensus forms the foundation of many modern blockchains striving for both high throughput and low latency. A growing bottleneck is transaction execution and validation on the critical path of consensus,…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-02-25 Ignacio Amores-Sesar , Mirza Ahad Baig , Seth Gilbert , Ray Neiheiser , Michelle X. Yeo

In this paper we propose Aleph, a leaderless, fully asynchronous, Byzantine fault tolerant consensus protocol for ordering messages exchanged among processes. It is based on a distributed construction of a partially ordered set and the…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-08-30 Adam Gągol , Michał Świętek

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

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

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