Easy intruder deductions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2772, Issue , 2004, Pages 225-242

  Comon Lundh, Hubert ^a   Treinen, Ralf ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION;

ALGEBRAIC PROPERTIES; CRYPTOGRAPHIC PRIMITIVES; CRYPTOGRAPHIC PROTOCOLS; DOLEV-YAO MODEL; EQUATIONAL THEORY; INTRUDER DEDUCTION; NORMAL FORM; POLYNOMIAL-TIME;

CRYPTOGRAPHY;

EID: 35248836596     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Article

References (15)

1. R. Amadio and W. Charatonik. On name generation and set-based analysis in the Dolev-Yao model. In Proc. CONCUR '02, volume 2421 of LNCS, pages 499-514, 2002.
2. Y. Chevalier, R. Kuester, M. Rusinowitch, and M. Turuani. An NP decision procedure for protocol insecurity with XOR. In Kolaitis [9], pages 261-270.
3. J. Clark and J. Jacob. A survey of authentication protocol literature, 1997. Available via http://www.cs.york.ac.uk/∼jac/papers/drareview.ps.gz.
4. H. Comon and V. Cortier. Tree automata with one memory, set constraints and cryptographic protocols. Theoretical Comput. Sci., 2003. To appear.
5. H. Comon-Lundh and V. Shmatikov. Constraint solving, exclusive or and the decision of confidentiality for security protocols assuming a bounded number of sessions. In Kolaitis [9], pages 271-280.
6. N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B - Formal Models and Semantics, chapter 6, pages 243-320. Elsevier Science Publishers and The MIT Press, 1990.
7. D. Dolev and A. Yao. On the security of public key protocols. IEEE Transactions on Information Theory, 29(2):198-208, 1983.
8. N. Durgin, P. Lincoln, J. Mitchell, and A. Scedrov. Undecidability of bounded security protocols. In Proc. Workshop on formal methods in security protocols, Trento, Italy, 1999.
9. P. Kolaitis, editor. Eighteenth Annual IEEE Symposium on Logic in Computer Science, Ottawa, Canada, June 2003. IEEE Computer Society.
10. Z. Manna and A. Pnueli. On the faithfulness of formal models. In Mathematical Foundations of Computer Science, volume 520 of Lecture Notes in Computer Science, pages 28-42. Springer-Verlag, 1991.
11. D. McAllester. Automatic recognition of tractability in inference relations. Journal of the ACM, 40(2):284-303, 1993.
12. M. Rusinowitch and M. Turuani. Protocol insecurity with finite number of sessions, composed keys is NP-complete. Theoretical Comput. Sci., 299(1-3):451-475, 2003.
13. G. J. Simmons. Cryptoanalysis and protocol failure. Commun. ACM, 37(11):56-65, Nov. 1994.
14. SPORE: The Security Protocol Open Repository. Available at http://www.lsv.ens-cachan.fr/spore/.
15. M. Tatebayashi, N. Matsuzaki, and D. B. Newmann. Key distribution protocol for digital mobile communication systems. In G. Brassard, editor, CRYPTO'89, volume 435 of Lecture Notes in Computer Science, pages 324-334. Springer-Verlag, 1989.