Results 11 to 20 of about 1,316 (199)
Nonrational Belief Paradoxes as Byzantine Failures [PDF]
Logos & Episteme, 2022 David Christensen and others argue that Dutch Strategies are more like peer disagreements than Dutch Books, and should not count against agents‘ conformity to ideal rationality. I review these arguments, then show that Dutch Books, Dutch Strategies, and peer disagreements are only possible in the case of what computer scientists call Byzantine Failures—
Miller, Ryan
openaire +2 more sources
Containing Byzantine Failures with Control Zones
IEEE Transactions on Parallel and Distributed Systems, 2015 We consider the problem of reliably broadcasting messages in a network where some nodes are likely to fail. We consider the most general failure model: the Byzantine model, where the failing nodes have an arbitrary behavior, and may actively try to destabilize the network. We focus on totally decentralized solutions.
Maurer, Alexandre, Tixeuil, Sébastien
openaire +3 more sources
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
Knowledge and Common Knowledge in a Byzantine Environment I: Crash failures
Information and Computation, 1986 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cynthia Dwork, Yoram Moses
openaire +2 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
On Implementing SWMR Registers from SWSR Registers in Systems with Byzantine Failures [PDF]
, 2022 The implementation of registers from (potentially) weaker registers is a classical problem in the theory of distributed computing. Since Lamport’s pioneering work [Leslie Lamport, 1986], this problem has been extensively studied in the context of ...
Hu, Xing, Toueg, Sam
core +1 more source
Asynchronous Reconfiguration with Byzantine Failures [PDF]
, 2020 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.
Tonkikh, Andrei, Kuznetsov, Petr
core +1 more source
On Blockchain-Enhanced Secure Data Storage and Sharing in Vehicular Edge Computing Networks
Applied Sciences, 2021 The conventional architecture of vehicular ad hoc networks (VANETs) with a centralized approach has difficulty overcoming the increasing complexity of intelligent transportation system (ITS) applications as well as challenges in providing large amounts ...
Muhammad Firdaus, Kyung-Hyune Rhee
doaj +1 more source
Byzantine Lattice Agreement in Asynchronous Systems [PDF]
, 2021 We study the Byzantine lattice agreement (BLA) problem in asynchronous distributed message passing systems. In the BLA problem, each process proposes a value from a join semi-lattice and needs to output a value also in the lattice such that all output ...
Garg, Vijay, Zheng, Xiong
core +1 more source
Beyond One Third Byzantine Failures
CoRR, 2015 The Byzantine agreement problem requires a set of $n$ processes to agree on a value sent by a transmitter, despite a subset of $b$ processes behaving in an arbitrary, i.e. Byzantine, manner and sending corrupted messages to all processes in the system.
Cheng Wang +4 more
openaire +2 more sources