English
Related papers

Related papers: Imitater: An Efficient Shared Mempool Protocol wit…

200 papers

Since the inception of Bitcoin, the distributed systems community has shown interest in the design of efficient blockchain systems. However, initial blockchain applications (like Bitcoin) attain very low throughput, which has promoted the…

Databases · Computer Science 2020-04-28 Suyash Gupta , Sajjad Rahnama , Mohammad Sadoghi

HotStuff is a state-of-the-art Byzantine fault-tolerant consensus protocol. It can be pipelined to build large-scale blockchains. One of its variants called LibraBFT is adopted in Facebook's Libra blockchain. Although it is well known that…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-07-13 Jianyu Niu , Fangyu Gai , Mohammad M. Jalalzai , Chen Feng

Arma is a Byzantine Fault Tolerant (BFT) consensus system designed to achieve horizontal scalability across all hardware resources: network bandwidth, CPU, and disk I/O. As opposed to preceding BFT protocols, Arma separates the…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-05-29 Yacov Manevich , Hagar Meir , Kaoutar Elkhiyaoui , Yoav Tock , May Buzaglo

We present new protocols for Byzantine state machine replication and Byzantine agreement in the synchronous and authenticated setting. The celebrated PBFT state machine replication protocol tolerates $f$ Byzantine faults in an asynchronous…

Distributed, Parallel, and Cluster Computing · Computer Science 2017-09-14 Ittai Abraham , Srinivas Devadas , Danny Dolev , Kartik Nayak , Ling Ren

Byzantine Fault Tolerance (BFT) enables correct operation of distributed, i.e., replicated applications in the face of malicious take-over and faulty/buggy individual instances. Recently, BFT designs have gained traction in the context of…

Networking and Internet Architecture · Computer Science 2019-08-15 Ermin Sakic , Nemanja Deric , Endri Goshi , Wolfgang Kellerer

The performance of partially synchronous BFT-based consensus protocols is highly dependent on the primary node. All participant nodes in the network are blocked until they receive a proposal from the primary node to begin the consensus…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-07-02 Mohammad M. Jalalzai , Chen Feng , Costas Busch , Golden G. Richard , Jianyu Niu

Byzantine State Machine Replication (SMR) is a long studied topic that received increasing attention recently with the advent of blockchains as companies are trying to scale them to hundreds of nodes. Byzantine SMRs try to increase…

Cryptography and Security · Computer Science 2020-06-15 Gauthier Voron , Vincent Gramoli

Several research projects have shown that Byzantine fault tolerance (BFT) is practical today in terms of performance. Deficiencies in other aspects might still be an obstacle to a more wide-spread deployment in real-world applications. One…

Cryptography and Security · Computer Science 2012-04-12 Benedikt Höfling , Hans P. Reiser

Verifiable Secret Sharing (VSS) has been widespread in Distributed Privacy-preserving Machine Learning (DPML), because invalid shares from malicious dealers or participants can be recognized by verifying the commitment of the received…

Cryptography and Security · Computer Science 2026-02-10 Zhen Li , Zijian Zhang , Wenjin Yang , Pengbo Wang , Zhaoqi Wang , Yan Wu , Xuyang Liu , Jing Sun

Multi-Byzantine Fault Tolerant (Multi-BFT) consensus allows multiple consensus instances to run in parallel, resolving the leader bottleneck problem inherent in classic BFT consensus. However, the global ordering of Multi-BFT consensus…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-03-04 Hanzheng Lyu , Shaokang Xie , Jianyu Niu , Ivan Beschastnikh , Yinqian Zhang , Mohammad Sadoghi , Chen Feng

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

Byzantine fault tolerance (BFT) consensus is a fundamental primitive for distributed computation. However, BFT protocols suffer from the ordering manipulation, in which an adversary can make front-running. Several protocols are proposed to…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-09-20 Guangren Wang , Liang Cai , Fangyu Gai , Jianyu Niu

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 rapidly emerging as a viable technology for production-grade systems, notably in closed consortia deployments for nancial and supply-chain applications. Unfortunately, most algorithms proposed so…

Databases · Computer Science 2019-11-11 Loïck Bonniot , Christoph Neumann , François Taïani

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

Recently, a novel peer sampling protocol, Elevator, was introduced to construct network topologies tailored for emerging decentralized applications such as federated learning and blockchain. Elevator builds hub-based topologies in a fully…

Cryptography and Security · Computer Science 2026-01-29 Mohamed Amine Legheraba , Nour Rachdi , Maria Gradinariu Potop-Butucaru , Sébastien Tixeuil

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

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

The concept of distributed consensus originated in the 1970s and gained widespread attention following Leslie Lamport's influential publication on the Byzantine Generals Problem in the 1980s. Over the past five decades, distributed…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-05-13 Huanyu Wu , Chentao Yue , Yixuan Fan , Yonghui Li , Lei Zhang
‹ Prev 1 3 4 5 6 7 10 Next ›