English
Related papers

Related papers: Mir-BFT: High-Throughput Robust BFT for Decentrali…

200 papers

Distributed ledgers are common in the industry. Some of them can use blockchains as their underlying infrastructure. A blockchain requires participants to agree on its contents. This can be achieved via a consensus protocol, and several BFT…

Performance · Computer Science 2024-11-13 J. D. Chan , Y. C. Tay , Brian R. Z. Yen

Byzantine Fault-Tolerant (BFT) consensus protocols ensure agreement on transaction ordering despite malicious actors, but unconstrained ordering power enables sophisticated value extraction attacks like front running and sandwich attacks -…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-10-17 Pengkun Ren , Hai Dong , Nasrin Sohrabi , Zahir Tari , Pengcheng Zhang

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

Despite recent progresses of practical asynchronous Byzantine fault tolerant (BFT) consensus, the state-of-the-art designs still suffer from suboptimal performance. Particularly, to obtain maximum throughput, most existing protocols with…

Cryptography and Security · Computer Science 2024-02-02 Yingzi Gao , Yuan Lu , Zhenliang Lu , Qiang Tang , Jing Xu , Zhenfeng Zhang

Distributed Ledger Technologies (DLTs), when managed by a few trusted validators, require most but not all of the machinery available in public DLTs. In this work, we explore one possible way to profit from this state of affairs. We devise…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-05-10 Marco Benedetti , Francesco De Sclavis , Marco Favorito , Giuseppe Galano , Sara Giammusso , Antonio Muci , Matteo Nardelli

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

We present HotStuff, a leader-based Byzantine fault-tolerant replication protocol for the partially synchronous model. Once network communication becomes synchronous, HotStuff enables a correct leader to drive the protocol to consensus at…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-07-24 Maofan Yin , Dahlia Malkhi , Michael K. Reiter , Guy Golan Gueta , Ittai Abraham

Byzantine state-machine replication (SMR) ensures the consistency of replicated state in the presence of malicious replicas and lies at the heart of the modern blockchain technology. Byzantine SMR protocols often guarantee safety under all…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-10-06 Manuel Bravo , Gregory Chockler , Alexey Gotsman

Critical infrastructures increasingly rely on interconnected and software-driven Cyber-Physical Systems (CPS), exposing operational processes to both accidental failures and sophisticated adversarial behavior. While Byzantine Fault Tolerant…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-04-21 Tadeu Freitas , João Soares , Rolando Martins

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

Byzantine fault-tolerant systems have been researched for more than four decades, and although shown possible early, the solutions were impractical for a long time. With PBFT the first practical solution was proposed in 1999 and spawned new…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-01-13 Thomas Loruenser , Benjamin Rainer , Florian Wohner

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

We propose uBFT, the first State-Machine Replication (SMR) system to achieve microsecond-scale latency in data centers, while using only $2f{+}1$ replicas to tolerate $f$ Byzantine failures. The Byzantine Fault Tolerance (BFT) provided by…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-02-17 Marcos K. Aguilera , Naama Ben-David , Rachid Guerraoui , Antoine Murat , Athanasios Xygkis , Igor Zablotchi

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

This paper presents a partially synchronous BFT consensus protocol powered by BBCA, a lightly modified Byzantine Consistent Broadcast (BCB) primitive. BBCA provides a Complete-Adopt semantic through an added probing interface to allow…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-05-28 Dahlia Malkhi , Chrysoula Stathakopoulou , Maofan Yin

This paper presents a novel leaderless protocol (FPC-BI: Fast Probabilistic Consensus within Byzantine Infrastructures) with a low communicational complexity and which allows a set of nodes to come to a consensus on a value of a single bit.…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-09-15 Serguei Popov , William J Buchanan

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

Motivated, in part, by the rise of permissionless systems such as Bitcoin where arbitrary nodes (whose identities are not known apriori) can join and leave at will, we extend established research in scalable Byzantine agreement to a more…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-07-26 John Augustine , Valerie King , Anisur R. Molla , Gopal Pandurangan , Jared Saia

Hyperledger Fabric is an enterprise grade permissioned distributed ledger platform that offers modularity for a broad set of industry use cases. One modular component is a pluggable ordering service that establishes consensus on the order…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-07-16 Artem Barger , Yacov Manevich , Hagar Meir , Yoav Tock

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
‹ Prev 1 4 5 6 7 8 10 Next ›