12 search results - page 1 / 3 » Abstracting Cryptographic Protocols with Tree Automata |
SAS
1999
Springer
13 years 9 months ago
1999
Springer
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...
IANDC
2007
13 years 4 months ago
2007
We explore the notion of alternating two-way tree automata modulo the theory of finitely many associative-commutative (AC) symbols. This was prompted by questions arising in cryp...
CADE
2005
Springer
14 years 5 months ago
2005
Springer
We prove that, if the initial knowledge of the intruder is given by a deterministic bottom-up tree automaton, then the insecurity problem for cryptographic protocols with atomic ke...
FUIN
2006
13 years 5 months ago
2006
Abstract. We analyse different versions of the Dining Cryptographers protocol by means of automatic verification via model checking. Specifically we model the protocol in terms of ...
IANDC
2007
13 years 4 months ago
2007
Cryptographic protocols can be divided into (1) protocols where the protocol steps are simple from a computational point of view and can thus be modeled by simple means, for insta...