Results 1 to 10 of about 556 (156)
Software Based Fault Tolerance Against Byzantine Failures
CLEI Electronic Journal, 2006 The proposed software technique is a very low cost and an effective solution towards designing Byzantine fault tolerant computing application systems that are not so safety critical.
Goutam Kumar Saha
doaj +3 more sources
Robust federated learning for cloud environments using evolutionary optimization and blockchain [PDF]
Scientific ReportsThe growing dependence on cloud-based distributed intelligence requires learning systems that can protect data privacy while maintaining efficiency. Federated learning has become an important method to train models without centralizing raw data, but its ...
S. P. Panimalar, S. Gunasundari
doaj +2 more sources
The Do-All problem with Byzantine processor failures
Theoretical Computer Science, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alexander Russell +2 more
exaly +3 more sources
SRFACS: A secure and robust framework for anonymous communication systems. [PDF]
PLoS ONEAnonymous communication is crucial for preserving user privacy in various applications, such as anonymous browsing, secure online payments, and electronic voting. However, current systems face significant challenges related to robustness, fault tolerance,
Daxin Zhu +6 more
doaj +2 more sources
All-to-All Gradecast Using Coding with Byzantine Failures [PDF]
Lecture Notes in Computer Science, 2012 This paper presents a method that uses forward error correction codes to minimize the message bit complexity when acquiring consistent global information in the presence of faulty processes. We show a modification to the gradecast algorithm that implements our method.
Vijay K Garg, Garg Vijay K
exaly +2 more sources
Distributed empirical likelihood inference with or without Byzantine failures
Statistics and ComputingEmpirical likelihood is a very important nonparametric approach which is of wide application. However, it is hard and even infeasible to calculate the empirical log-likelihood ratio statistic with massive data. The main challenge is the calculation of the Lagrange multiplier.
, Wang Qihua
exaly +4 more sources
Byzantine Agreement with Unknown Participants and Failures [PDF]
2021 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2021 A set of mutually distrusting participants that want to agree on a common opinion must solve an instance of a Byzantine agreement problem. These problems have been extensively studied in the literature. However, most of the existing solutions assume that the participants are aware of $n$ -- the total number of participants in the system -- and $f ...
Pankaj Khanchandani, Roger Wattenhofer
openaire +2 more sources
Dynamic Byzantine Broadcast in Asynchronous Message-Passing Systems
IEEE Access, 2022 The reconfiguration problem is considered a key challenge in distributed systems, especially in dynamic asynchronous message-passing systems.
Jing Li +3 more
doaj +1 more source
Asynchronous reconfiguration with Byzantine failures
Distributed Computing, 2022 Replicated services are inherently vulnerable to failures and security breaches. In a long-running system, it is, therefore, indispensable to maintain a reconfiguration mechanism that would replace faulty replicas with correct ones. An important challenge is to enable reconfiguration without affecting the availability and consistency of the replicated ...
Petr Kuznetsov, Andrei Tonkikh
openaire +5 more sources
Future Internet, 2022 Blockchain technology can solve the problem of trust in the open network in a decentralized way. It has broad application prospects and has attracted extensive attention from academia and industry.
Huanliang Xiong +4 more
doaj +1 more source