21 search results - page 3 / 5 » Consensus with Byzantine Failures and Little System Synchron... |
PODC
2009
ACM
14 years 6 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 ...
EDCC
2010
Springer
13 years 10 months ago
2010
Springer
: While lots of consensus algorithms have been proposed for crash-prone asynchronous message-passing systems enriched with a failure detector of the class Ω (the class of eventua...
DSN
2002
IEEE
13 years 10 months ago
2002
IEEE
This paper shows that, in an environment where we do not bound the number of faulty processes, the class P of Perfect failure detectors is the weakest (among realistic failure det...
SSS
2007
Springer
13 years 12 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...
PODC
2009
ACM
14 years 17 days ago
2009
ACM
We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...