Download:
|
by Hubert Comon-lundh, Ralf Treinen
http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/rr-lsv-2003-8.rr.ps
Add To MetaCart
Abstract:
We investigate extensions of the Dolev-Yao model by some algebraic properties of cryptographic primitives. We provide sucient conditions under which the intruder deduction problem is decidable (resp. decidable in polynomial time). We apply this result to the equational theory of homomorphism, and show that in this case the intruder deduction problem is linear, provided that the messages are in normal form. 1
Citations
|
703
|
On the security of public key protocols
– Dolev, Yao
- 1983
|
|
176
|
A Survey of Authentication Protocol Literature: Version 1.0
– Clark, Jacob
- 1997
|
|
106
|
Undecidability of bounded security protocols
– Durgin, Lincoln, et al.
- 1999
|
|
61
|
An NP decision procedure for protocol insecurity with xor
– Chevalier, Küsters, et al.
|
|
57
|
Key distribution protocol for digital mobile communication systems
– Tatebayashi, Matsuzaki, et al.
- 1990
|
|
49
|
Automatic recognition of tractability in inference relations
– McAllester
- 1990
|
|
42
|
On name generation and set-based analysis in the dolev-yao model
– Amadio, Charatonik
- 2002
|
|
19
|
Cryptoanalysis and protocol failure
– Simmons
- 1994
|
|
7
|
On the faithfulness of formal models
– Manna, Pnueli
- 1991
|
|
7
|
Protocol insecurity with number of sessions is np-complete
– Rusinowitch, Turuani
- 2001
|
|
2
|
Comon and Veronique Cortier. Tree automata with one memory, set constraints and cryptographic protocols. Theoretical Computer Science
– Hubert
- 2003
|
|
1
|
Constraint solving, exclusive or and the decision of con for security protocols assuming a bounded number of sessions
– Comon-Lundh, Shmatikov
- 1994
|
|
1
|
The Security Protocol Open Repository. http://www.lsv.ens-cachan. fr/spore
– SPORE
|
