42 search results - page 6 / 9 » The Weakest Failure Detector for Solving Consensus |
CONCUR
2003
Springer
14 years 20 days ago
2003
Springer
Abstract. We give a process calculus model that formalizes a wellknown algorithm (introduced by Chandra and Toueg) solving consensus in the presence of a particular class of failur...
PODC
2009
ACM
14 years 8 months ago
2009
ACM
d Abstract] Marcos K. Aguilera Microsoft Research Silicon Valley Mountain View, CA, USA Carole Delporte-Gallet Universit? Paris 7 Paris, France Hugues Fauconnier Universit? Paris ...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
The Sybil attack in unknown port networks such as wireless is not considered tractable. A wireless node is not capable of independently differentiating the universe of real nodes f...
SSS
2007
Springer
14 years 1 months ago
2007
Springer
We present a modular redesign of TrustedPals, a smartcard-based security framework for solving secure multiparty computation (SMC)[?]. TrustedPals allows to reduce SMC to the probl...
EDCC
2005
Springer
14 years 1 months ago
2005
Springer
Unreliable failure detectors are a well known means to enrich asynchronous distributed systems with time-free semantics that allow to solve consensus in the presence of crash failu...