Sciweavers

37 search results - page 7 / 8
» Tolerating Byzantine Faulty Clients in a Quorum System
Sort
View
IPCCC
2006
IEEE
13 years 11 months ago
Maille authorization - a distributed, redundant authorization protocol
The Maille Authorization protocol provides flexible and reliable authorization in large distributed and pervasive computing systems. Service owners distribute their access control...
Andrew Fritz, Jehan-François Pâris
SAC
2010
ACM
14 years 19 days ago
Asynchronous Byzantine consensus with 2f+1 processes
Byzantine consensus in asynchronous message-passing systems has been shown to require at least 3f + 1 processes to be solvable in several system models (e.g., with failure detecto...
Miguel Correia, Giuliana Santos Veronese, Lau Cheu...
ICDCS
2003
IEEE
13 years 11 months ago
Responsive Security for Stored Data
We present the design of a distributed store that offers various levels of security guarantees while tolerating a limited number of nodes that are compromised by an adversary. The...
Subramanian Lakshmanan, Mustaque Ahamad, H. Venkat...
SIGSOFT
2007
ACM
14 years 6 months ago
Fault and adversary tolerance as an emergent property of distributed systems' software architectures
Fault and adversary tolerance have become not only desirable but required properties of software systems because mission-critical systems are commonly distributed on large network...
Yuriy Brun, Nenad Medvidovic
ICDCS
2011
IEEE
12 years 5 months ago
Smart Redundancy for Distributed Computation
Many distributed software systems allow participation by large numbers of untrusted, potentially faulty components on an open network. As faults are inevitable in this setting, th...
Yuriy Brun, George Edwards, Jae Young Bang, Nenad ...