On name generation and set-based analysis in the Dolev-Yao model

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

Volumn 2421 LNCS, Issue , 2002, Pages 499-514

  Amadio, Roberto M ^a   Charatonik, Witold ^b,c  

^a AIX MARSEILLE UNIV   (France)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^c UNIVERSITY OF WROC AW   (Poland)

Author keywords

Cryptographic protocols; Name generation; Set constraints; Verification

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; CRYPTOGRAPHY; VERIFICATION;

CONTROL REACHABILITY; CRYPTOGRAPHIC PROTOCOLS; DOLEV-YAO MODEL; NAME GENERATION; OPERATIONAL SEMANTICS; SET CONSTRAINTS; SET-BASED ANALYSIS; TAIL RECURSIVE;

SEMANTICS;

EID: 84874678490     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45694-5_33     Document Type: Conference Paper

References (19)

1. R. Amadio, D. Lugiez, and V. Vanackere. On the symbolic reduction of processes with cryptographic functions. Theoretical Computer Science (to appear). Also RR 4147, INRIA.
2. R. Amadio, W. Charatonik. On name generation and set-based analysis in the Dolev-Yao model. RR-INRIA 4379, January 2002.
3. R. Amadio, C. Meyssonnier. On the decidability of fragments of the asynchronous π-calculus. Journal of Nordic Computing (to appear). Also RR-INRIA 4241.
4. W. Charatonik and A. Podelski. Set constraints with intersection. In Proc. 12th IEEE LICS, 1997.
5. W. Charatonik, A. Podelski, and J.-M. Talbot. Paths vs. trees in set-based program analysis. In Proc. 27th Annual ACM POPL, 2000.
6. H. Comon, V. Cortier, and J. Mitchell. Tree automata with one memory, set constraints, and ping-pong protocols. In Proc. ICALP, Springer Lecture Notes in Comp. Sci. 2076, 2001.
7. J. Clark and J. Jacob. A survey of authentication protocol literature: Version 1.0. Available at http://www-users.cs.york.ac.uk/~jac/papers/drareview. ps.gz, 1997.
8. D. Dolev, S. Even, and R. Karp. On the security of ping-pong protocols. Information and Control, 55:57-68, 1982.
9. N. Durgin, P. Lincoln, J. Mitchell, and A. Scedrov. Undecidability of bounded security protocols. In Proc. Formal methods and security protocols, FLOC Workshop, Trento, 1999.
10. D. Dolev and A. Yao. On the security of public key protocols. IEEE Trans. on Information Theory, 29(2):198-208, 1983.
11. T. Genet and F. Klay. Rewriting for cryptographic protocol verification. In Proc. CADE, Springer Lecture Notes in Comp. Sci. 1831, 2000.
12. J. Goubault. A method for automatic cryptographic protocol verification. In Proc. FMPPTA, Springer-Verlag, 2000.
13. N. Heintze and J. Jaffar. A decision procedure for a class of set constraints (extended abstract). In Proc. 5th IEEE LICS, 1990.
14. N. Heintze and J. Jaffar. Set constraints and set-based analysis. In Proc. Workshop on Principles and Practice of Constraint Programming, Springer Lecture Notes in Comp. Sci. 874, 1994.
15. D. Monniaux. Abstracting cryptographic protocols with tree automata. In Proc. Static Analysis Symposium, Springer Lect. Notes in Comp. Sci., 1999.
16. M. Rusinowitch and M. Turuani Protocol insecurity with finite number of sessions is NP-complete. RR INRIA 4134, March 2001.
17. S. Stoller. A bound on attacks on authentication protocols. TR 526, Indiana University, CS Dept., july 1999.
18. J.-M. Talbot, Ph. Devienne, and S. Tison. Generalized definite set constraints. Constraints: An International Journal, 5(1-2):161-202, January 2000.
19. C. Weidenbach. Towards an automatic analysis of security protocols in first-order logic. In Proc. CADE 99. Springer Lect. Notes in Comp. Sci. (LNAI) 1632, 1999.