English
Related papers

Related papers: SplitBFT: Improving Byzantine Fault Tolerance Safe…

200 papers

With the increasing importance of machine learning, the privacy and security of training data have become critical. Federated learning, which stores data in distributed nodes and shares only model parameters, has gained significant…

Machine Learning · Computer Science 2025-07-10 Yang Li , Chunhe Xia , Chang Li , Tianbo Wang

Distributed learning has become a necessity for training ever-growing models by sharing calculation among several devices. However, some of the devices can be faulty, deliberately or not, preventing the proper convergence. As a matter of…

Machine Learning · Computer Science 2022-02-08 Jason Akoun , Sebastien Meyer

Blockchains face inherent limitations when communicating outside their own ecosystem, largely due to the Byzantine Fault Tolerant (BFT) 3f+1 security model. Trusted Execution Environments (TEEs) are a promising mitigation because they allow…

Theoretical Economics · Economics 2025-11-06 Alex Shamis , Matt Stephenson , Linfeng Zhou

With the increasing ubiquity of autonomous robotic solutions, the interest in their connectivity and in the cooperation within multi-robot systems is rising. Two aspects that are a matter of current research are robot security and secure…

Robotics · Computer Science 2022-08-30 Farhad Keramat , Jorge Peña Queralta , Tomi Westerlund

Existing blockchain systems scale poorly because of their distributed consensus protocols. Current attempts at improving blockchain scalability are limited to cryptocurrency. Scaling blockchain systems under general workloads (i.e.,…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-03-13 Hung Dang , Tien Tuan Anh Dinh , Dumitrel Loghin , Ee-Chien Chang , Qian Lin , Beng Chin Ooi

In this paper we demonstrate how stateful Byzantine Fault Tolerant services may be hosted on a Chord ring. The strategy presented is fourfold: firstly a replication scheme that dissociates the maintenance of replicated service state from…

Distributed, Parallel, and Cluster Computing · Computer Science 2010-06-18 Alan Dearle , Graham Kirby , Stuart Norcross

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

Currently there exist many blockchains with weak trust guarantees, limiting applications and participation. Existing solutions to boost the trust using a stronger blockchain, e.g., via checkpointing, requires the weaker blockchain to give…

Cryptography and Security · Computer Science 2023-09-22 Peiyao Sheng , Xuechao Wang , Sreeram Kannan , Kartik Nayak , Pramod Viswanath

We consider the problem of varying the security of blockchain transactions according to their importance. This adaptive security is achieved by using variable size consensus committees. To improve performance, such committees function…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-08-01 Shishir Rai , Kendric Hood , Mikhail Nesterenko , Gokarna Sharma

A shared read/write register emulation provides the illusion of shared-memory on top of message-passing models. The main hurdle with such emulations is dealing with server faults in the system. Several crash-tolerant register emulations in…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-10-16 Saptaparni Kumar , Jennifer L. Welch

This paper presents Basil, the first transactional, leaderless Byzantine Fault Tolerant key-value store. Basil leverages ACID transactions to scalably implement the abstraction of a trusted shared log in the presence of Byzantine actors.…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-10-06 Florian Suri-Payer , Matthew Burke , Zheng Wang , Yunhao Zhang , Lorenzo Alvisi , Natacha Crooks

Traditionally, Byzantine fault tolerance (BFT) in geo-replicated systems is achieved by executing complex agreement protocols over large-distance communication links, and therefore typically incurs high response times. In this paper we…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-07-12 Michael Eischer , Tobias Distler

Most methods for Byzantine fault tolerance (BFT) in the partial synchrony setting divide the local state of the nodes into views, and the transition from one view to the next dictates a leader change. In order to provide liveness, all…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-02-07 Oded Naor , Mathieu Baudet , Dahlia Malkhi , Alexander Spiegelman

Decentralized learning involves training machine learning models over remote mobile devices, edge servers, or cloud servers while keeping data localized. Even though many studies have shown the feasibility of preserving privacy, enhancing…

Cryptography and Security · Computer Science 2022-01-07 Minghui Xu , Zongrui Zou , Ye Cheng , Qin Hu , Dongxiao Yu , Xiuzhen Cheng

We analyze the impact of transient and Byzantine faults on the construction of a maximal independent set in a general network. We adapt the self-stabilizing algorithm presented by Turau `for computing such a vertex set. Our algorithm is…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-06-11 Johanne Cohen , Laurence Pilard , François Pirot , Jonas Sénizergues

Recent advancements in machine learning have improved performance while also increasing computational demands. While federated and distributed setups address these issues, their structures remain vulnerable to malicious influences. In this…

Recent advances in generative AI have enabled sophisticated multi-agent architectures for healthcare, where large language models power collaborative clinical decision-making. However, these distributed systems face critical challenges in…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-12-23 Nihir Chadderwala

Blockchain technology enhances transparency by maintaining a distributed ledger among mutually untrusting parties. Despite its advantages, scalability and availability remain critical bottlenecks that hinder widespread adoption. The…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-04-20 Manaswini Piduguralla , Souvik Sarkar , Arunmoezhi Ramachandran , Sathya Peri

Quorum systems are a key abstraction in distributed fault-tolerant computing for capturing trust assumptions. They can be found at the core of many algorithms for implementing reliable broadcasts, shared memory, consensus and other…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-05-03 Orestis Alpos , Christian Cachin , Björn Tackmann , Luca Zanolini

Distributed control systems require high reliability and availability guarantees despite often being deployed at the edge of network infrastructure. Edge computing resources are less secure and less reliable than centralized resources in…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-02-21 Roy Shadmon , Daniel Spencer , Owen Arden
‹ Prev 1 8 9 10 Next ›