English
Related papers

Related papers: Adelie: Detection and prevention of Byzantine beha…

200 papers

Existing Byzantine fault tolerance (BFT) protocols face significant challenges in the consortium blockchain scenario. On the one hand, we can make little assumptions about the reliability and security of the underlying Internet. On the…

Distributed, Parallel, and Cluster Computing · Computer Science 2018-02-06 Peilun Li , Guosai Wang , Xiaoqi Chen , Wei Xu

Byzantine agreement algorithms typically assume implicit initial state consistency and synchronization among the correct nodes and then operate in coordinated rounds of information exchange to reach agreement based on the input values. The…

Distributed, Parallel, and Cluster Computing · Computer Science 2009-08-04 Ariel Daliot , Danny Dolev

In this paper we present an open source, fully asynchronous, leaderless algorithm for reaching consensus in the presence of Byzantine faults in an asynchronous network. We prove the algorithm's correctness provided that less than a third of…

Cryptography and Security · Computer Science 2019-07-29 Pierre Chevalier , Bartlomiej Kaminski , Fraser Hutchison , Qi Ma , Spandan Sharma , Andreas Fackler , William J Buchanan

Blockchain technology offers a decentralized and secure method for storing and authenticating data, rendering it well-suited for various applications such as digital currencies, supply chain management, and voting systems. However, the…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-04-25 Mohammad R. Shakournia , Pooya Jamshidi , Hamid Reza Faragardi , Nasser Yazdani

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

This paper investigates the problem \textit{good-case latency} of Byzantine agreement, broadcast and state machine replication in the synchronous authenticated setting. The good-case latency measure captures the time it takes to reach…

Cryptography and Security · Computer Science 2020-12-22 Ittai Abraham , Kartik Nayak , Ling Ren , Zhuolun Xiang

Byzantine fault-tolerant (BFT) protocols allow a group of replicas to come to a consensus even when some of the replicas are Byzantine faulty. There exist multiple BFT protocols to securely tolerate an optimal number of faults $t$ under…

Cryptography and Security · Computer Science 2021-11-09 Peiyao Sheng , Gerui Wang , Kartik Nayak , Sreeram Kannan , Pramod Viswanath

DAG-based consensus has attracted significant interest due to its high throughput in asynchronous network settings. However, existing protocols such as DAG-rider (Keidar et al., PODC 2021) and ``Narwhal and Tusk'' (Danezis et al., Eurosys…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-11-14 Keyang Liu , Maxim Jourenko , Mario Larangeira

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

Byzantine Fault Tolerant (BFT) consensus protocols for dynamically available systems face a critical challenge: balancing latency and security in fluctuating node participation. Existing solutions often require multiple rounds of voting per…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-09-04 Pengkun Ren , Hai Dong , Zahir Tari , Pengcheng Zhang

This paper studies the design of Byzantine consensus algorithms in an \textit{asynchronous }single-hop network equipped with the "abstract MAC layer" [DISC09], which captures core properties of modern wireless MAC protocols. Newport…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-11-07 Lewis Tseng , Callie Sardina

Blockchains use consensus protocols to reach agreement, e.g., on the ordering of transactions. DAG-based consensus protocols are increasingly adopted by blockchain companies to reduce energy consumption and enhance security. These protocols…

Logic in Computer Science · Computer Science 2025-03-19 Nathalie Bertrand , Pranav Ghorpade , Sasha Rubin , Bernhard Scholz , Pavle Subotic

Byzantine fault-tolerant (BFT) consensus algorithms are at the core of providing safety and liveness guarantees for distributed systems that must operate in the presence of arbitrary failures. Recently, numerous new BFT algorithms have been…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-12-06 Gengrui Zhang , Fei Pan , Yunhao Mao , Sofia Tijanic , Michael Dang'ana , Shashank Motepalli , Shiquan Zhang , Hans-Arno Jacobsen

Consensus is a fundamental building block for constructing reliable and fault-tolerant distributed services. Many Byzantine fault-tolerant consensus protocols designed for partially synchronous systems adopt a pessimistic approach when…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-06-12 Diogo Avelãs , Hasan Heydari , Eduardo Alchieri , Tobias Distler , Alysson Bessani

Agreement protocols are crucial in various emerging applications, spanning from distributed (blockchains) oracles to fault-tolerant cyber-physical systems. In scenarios where sensor/oracle nodes measure a common source, maintaining output…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-05-08 Akhil Bandarupalli , Adithya Bhat , Saurabh Bagchi , Aniket Kate , Chen-Da Liu-Zhang , Michael K. Reiter

Classic Byzantine fault-tolerant consensus protocols forfeit liveness in the face of asynchrony in order to preserve safety, whereas most deployed blockchain protocols forfeit safety in order to remain live. In this work, we achieve the…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-07-06 Alistair Stewart , Eleftherios Kokoris-Kogia

LibraBFT is a Byzantine Fault Tolerant (BFT) consensus protocol based on HotStuff. We present an abstract model of the protocol underlying HotStuff / LibraBFT, and formal, machine-checked proofs of their core correctness (safety) property…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-03-30 Harold Carr , Christopher Jenkins , Mark Moir , Victor Cacciari Miraldo , Lisandra Silva

Avalanche is a blockchain consensus protocol with exceptionally low latency and high throughput. This has swiftly established the corresponding token as a top-tier cryptocurrency. Avalanche achieves such remarkable metrics by substituting…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-10-10 Ignacio Amores-Sesar , Christian Cachin , Enrico Tedeschi

Direct Acyclic Graph (DAG)-based ledger and the corresponding consensus algorithm has been identified as a promising technology for Internet of Things (IoT). Compared with Proof-of-Work (PoW) and Proof-of-Stake (PoS) that have been widely…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-05-19 Yixin Li , Bin Cao , Mugen Peng , Long Zhang , Lei Zhang , Daquan Feng , Jihong Yu

This paper introduces Nemo-Nemo, a practical crash-fault tolerant (CFT) consensus protocol designed to outperform existing protocols in wide-area networks by bridging design principles from the CFT and Byzantine-fault tolerant (BFT) worlds.…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-04-13 Rithwik Kerur , Pasindu Tennage , Philipp Jovanovic , Dahlia Malkhi , Alberto Sonnino , Igor Zablotchi