Results 111 to 120 of about 1,316 (199)

Byzantine Failure Detection for Dynamic Distributed Systems

open access: yes, 2010
Les détecteurs de défaillances Byzantines offrent une abstraction élégante pour implanter la tolérance aux fautes Byzantines. Cependant, à notre connaissance, il n'existe pas de solution générale pour ce problème dans un système réparti dynamique. Cet article présente un premier détecteur de défaillance Byzantin pour ce type d'environnement.
Santos de Lima, Murilo   +3 more
openaire   +1 more source

Asynchronous byzantine consensus: Complexity, re and authentication

open access: yes, 2004
. We present a consensus algorithm that tolerates Byzantine process failures and arbitrarily long periods of network asynchrony. Our algorithm is the first to match the general time-complexity lower bound of [14], for which we give a complete proof. When
P. Dutta, R. Guerraoui, M. Vukolić
core  

Communication and Agreement Abstractions in the Presence of Byzantine Processes

open access: yes, 2014
Byzantine process is a process that --intentionally or not-- behaves arbitrarily (Byzantine failures include crash and omission failures). Considering message-passing systems, this paper presents communication and agreement abstractions that allow non ...
Mostefaoui, Achour, Raynal, Michel
core  

Forensic Support for Abraham et al.'s BB Protocol. [PDF]

open access: yesEntropy (Basel)
You Q   +5 more
europepmc   +1 more source

Byzantine Failures and Security: Arbitrary is not (always) Random

open access: yes
The Byzantine failure model allows arbitrary behavior of a certain fraction of network nodes in a distributed system. It was introduced to model and analyse the effects of very severe hardware faults in aircraft control systems.
Gaertner, Felix C.
core  

Home - About - Disclaimer - Privacy