Sciweavers

28 search results - page 3 / 6
» A Certified E-Mail Protocol
Sort
View
CADE
2008
Springer
14 years 5 months ago
Certifying a Tree Automata Completion Checker
Tree automata completion is a technique for the verification of infinite state systems. It has already been used for the verification of cryptographic protocols and the prototyping...
Benoît Boyer, Thomas Genet, Thomas P. Jensen
SRDS
2010
IEEE
13 years 3 months ago
P-Store: Genuine Partial Replication in Wide Area Networks
Partial replication is a way to increase the scalability of replicated systems since updates only need to be applied to a subset of the system's sites, thus allowing replicas...
Nicolas Schiper, Pierre Sutra, Fernando Pedone
PODC
2005
ACM
13 years 10 months ago
On the establishment of distinct identities in overlay networks
Abstract We study ways to restrict or prevent the damage that can be caused in a peer-to-peer network by corrupt entities creating multiple pseudonyms. We show that it is possible ...
Rida A. Bazzi, Goran Konjevod
SAS
1999
Springer
117views Formal Methods» more  SAS 1999»
13 years 9 months ago
Abstracting Cryptographic Protocols with Tree Automata
ing Cryptographic Protocols with Tree Automata David Monniaux http://www.di.ens.fr/%7Fmonniaux, Laboratoire d’Informatique, ´Ecole Normale Sup´erieure, 45 rue d’Ulm , 75230 P...
David Monniaux
CCR
2000
78views more  CCR 2000»
13 years 5 months ago
Some guidelines for non-repudiation protocols
Non-repudiation protocols aim at preventing parties in a communication from falsely denying having taken part in that communication; for example, a non-repudiation protocol for di...
Panagiotis Louridas