English
Related papers

Related papers: Aleph: Efficient Atomic Broadcast in Asynchronous …

200 papers

We consider the problem of reliably broadcasting information in a multihop asyn- chronous network that is subject to Byzantine failures. That is, some nodes of the network can exhibit arbitrary (and potentially malicious) behavior. Existing…

Data Structures and Algorithms · Computer Science 2012-01-30 Alexandre Maurer , Sébastien Tixeuil

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

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 Byzantine agreement problem is considered to be a core problem in distributed systems. For example, Byzantine agreement is needed to build a blockchain, a totally ordered log of records. Blockchains are asynchronous distributed systems,…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-05-27 Ye Wang , Roger Wattenhofer

This paper presents LinSBFT, a Byzantine Fault Tolerance (BFT) protocol with the capacity of processing over 2000 smart contract transactions per second in production. LinSBFT applies to a permissionless, public blockchain system, in which…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-07-16 Xiaodong Qi , Yin Yang , Zhao Zhang , Cheqing Jin , Aoying Zhou

Vote-based blockchains construct a state machine replication (SMR) system among participating nodes, using Byzantine Fault Tolerance (BFT) consensus protocols to transition from one state to another. Currently, they rely on either…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-12-25 Yibin Xu , Jianhua Shao , Tijs Slaats , Boris Düdder , Yongluan Zhou

Permissionless blockchain protocols are known to consume an outrageous amount of computing power and suffer from a trade-off between latency and confidence in transaction confirmation. The recently proposed Algorand blockchain protocol…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-05-03 Kadir Korkmaz , Joachim Bruneau-Queyreix , Sonia Ben Mokthar , Laurent Réveillère

In this paper we analyse the correctness of Istanbul BFT (IBFT), which is a Byzantine-fault-tolerant (BFT) proof-of-authority (PoA) blockchain consensus protocol that ensures immediate finality. We show that the IBFT protocol does not…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-08-28 Roberto Saltini , David Hyland-Wood

Byzantine fault tolerant (BFT) protocol descriptions often assume application-layer networking primitives, such as best-effort and reliable broadcast, which are impossible to implement in practice in a Byzantine environment as they require…

Networking and Internet Architecture · Computer Science 2024-11-01 Manu Drijvers , Tim Gretler , Yotam Harchol , Tobias Klenze , Ognjen Maric , Stefan Neamtu , Yvonne-Anne Pignolet , Rostislav Rumenov , Daniel Sharifi , Victor Shoup

With the advancement of blockchain systems, many recent research works have proposed distributed ledger technology~(DLT) that employs Byzantine fault-tolerant~(BFT) consensus protocols to decide which block to append next to the ledger.…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-03-21 Christian Berger , Signe Schwarz-Rüsch , Arne Vogel , Kai Bleeke , Leander Jehl , Hans P. Reiser , Rüdiger Kapitza

Blockchains use peer-to-peer networks for disseminating information among peers, but these networks currently do not have any provable guarantees for desirable properties such as Byzantine fault tolerance, good connectivity and small…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-02-01 Vijeth Aradhya , Seth Gilbert , Aquinas Hobor

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

Zef was recently proposed to extend the low-latency, Byzantine-Fault Tolerant (BFT) payment protocol FastPay with anonymous coins. This report explores further extensions of FastPay and Lef beyond payments. We start by off-chain assets…

Cryptography and Security · Computer Science 2022-01-14 Mathieu Baudet , Alberto Sonnino , Michal Krol

Byzantine consensus is a critical component in many permissioned Blockchains and distributed ledgers. We propose a new paradigm for designing BFT protocols called DQBFT that addresses three major performance and scalability challenges that…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-03-01 Balaji Arun , Binoy Ravindran

Mission critical systems deployed in data centers today are facing more sophisticated failures. Byzantine fault tolerant (BFT) protocols are capable of masking these types of failures, but are rarely deployed due to their performance cost…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-10-25 Guangda Sun , Xin Zhe Khooi , Yunfan Li , Mingliang Jiang , Jialin Li

The goal of Byzantine Broadcast (BB) is to allow a set of fault-free nodes to agree on information that a source node wants to broadcast to them, in the presence of Byzantine faulty nodes. We consider design of efficient algorithms for BB…

Distributed, Parallel, and Cluster Computing · Computer Science 2012-05-03 Guanfeng Liang , Nitin Vaidya

Byzantine Fault Tolerant (BFT) consensus, a cornerstone of blockchain technology, has seen significant advancements. While existing BFT protocols ensure security guarantees, they often suffer from efficiency challenges, particularly under…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-04-15 Qingming Zeng , Mo Li , Ximing Fu , Chuanyi Liu , Hui Jiang

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

Blockchains are distributed secure ledgers to which transactions are issued continuously and each block of transactions is tightly coupled to its predecessors. Permissioned blockchains place special emphasis on transactions throughput. In…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-11-04 Yehonatan Buchnik , Roy Friedman

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