Sciweavers

146 search results - page 7 / 30
» Fault-Tolerant Distributed Theorem Proving
Sort
View
DSE
1998
80views more  DSE 1998»
13 years 7 months ago
The Voltan application programming environment for fail-silent processes
The Voltan software library for building distributed applications provides the support for (i) a processpair to act as single Voltan self-checking ‘fail-silent’ process; and (...
Dave Black, C. Low, Santosh K. Shrivastava
IPPS
2008
IEEE
14 years 1 months ago
What is the best way to prove a cryptographic protocol correct?
In this paper, we identify that protocol verification using invariants have significant limitations such as inapplicability to some protocols, non-standard attacker inferences a...
Sreekanth Malladi, Gurdeep S. Hura
SPAA
2010
ACM
14 years 5 days ago
Brief announcement: byzantine agreement with homonyms
In this work, we address Byzantine agreement in a message passing system with homonyms, i.e. a system with a number l of authenticated identities that is independent of the total ...
Carole Delporte-Gallet, Hugues Fauconnier, Rachid ...
ICDCS
2007
IEEE
14 years 1 months ago
Supporting Robust and Secure Interactions in Open Domains through Recovery of Trust Negotiations
Trust negotiation supports authentication and access control across multiple security domains by allowing parties to use non-forgeable digital credentials to establish trust. By t...
Anna Cinzia Squicciarini, Alberto Trombetta, Elisa...
PDCAT
2005
Springer
14 years 26 days ago
A New Algorithm to Solve Synchronous Consensus for Dependent Failures
Fault tolerant algorithms are often designed under the t-out-of-n assumption, which is based on the assumption that all processes or components fail independently with equal proba...
Jun Wang, Min Song