Extending the Dolev-Yao intruder for analyzing an unbounded number of sessions

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

Volumn 2803, Issue , 2003, Pages 128-141

  Chevalier, Yannick ^a   Küsters, Ralf ^b   Rusinowitch, Michael ^a   Turuani, Mathieu ^a   Vigneron, Laurent ^a  

^a LORIA   (France)

^b Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

CRYPTOGRAPHIC PROTOCOLS; DOLEV-YAO INTRUDERS; PROTOCOL MODEL;

ARTIFICIAL INTELLIGENCE;

EID: 26944465513     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45220-1_13     Document Type: Article

References (19)

1. R.M. Amadio and W. Charatonik. On Name Generation and Set-Based Analysis in the Dolev-Yao Model. In CONCUR 2002, LNCS 2421, pages 499-514. Springer-Verlag, 2002.
2. R.M. Amadio, D. Lugiez, and V. Vanackère. On the symbolic reduction of processes with cryptographic functions. Technical Report RR-4147, INRIA, 2001.
3. A. Armando, D. Basin, M. Bouallagui, Y. Chevalier, L. Compagna, S. Mödersheim, M. Rusinowitch, M. Turuani, L. Viganò, and L. Vigneron. The AVISS Security Protocol Analysis Tool. In CAV 2002, LNCS 2404, pages 349-353. Springer, 2002.
4. Y. Chevalier, R. Küsters, M. Rusinowitch, M. Turuani, and L. Vigneron. Extending the Dolev-Yao Intruder for Analyzing an Unbounded Number of Sessions. Technical Report available at http://www.inria.fr/rrrt/liste-2003.html. To appear.
5. Y. Chevalier, R. Küsters, M. Rusinowitch, and M. Turuani. An NP decision procedure for protocol insecurity with XOR. In Proceedings of LICS 2003, 2003. To appear.
6. Y. Chevalier and L. Vigneron. Automated unbounded verification of security protocols. In CAV 2002, Springer, 2002.
7. J. Clark and J. Jacob. A Survey of Authentication Protocol Literature, 1997. Web Draft Version 1.0 available from http://citeseer.nj.nec.com/.
8. H. Comon-Lundh and V. Cortier. New decidability results for fragments of first-order logic and application to cryptographic protocols. In Proc. 14th Int. Conf. Rewriting Techniques and Applications (RTA'2003), Valencia, Spain, June 2003, volume 2706 of LNCS. To appear.
9. H. Comon and V. Shmatikov. Is it possible to decide whether a cryptographic protocol is secure or not? Journal of Telecommunications and Information Technology, 2002. To appear.
10. E. Dantsin, T. Eiter, G. Gottlob, and A. Voronkov. Complexity and expressive power of logic programming. In CCC'97, pages 82-101. IEEE Computer Society, 1997.
11. D. Dolev, S. Even, and R.M. Karp. On the Security of Ping-Pong Protocols. Information and Control, 55:57-68, 1982.
12. D. Dolev and A.C. Yao. On the Security of Public-Key Protocols. IEEE Transactions on Information Theory, 29(2):198-208, 1983.
13. N.A. Durgin, P.D. Lincoln, J.C. Mitchell, and A. Scedrov. Undecidability of bounded security protocols. In Workshop on Formal Methods and Security Protocols (FMSP'99), 1999.
14. S. Even and O. Goldreich. On the Security of Multi-Party Ping-Pong Protocols. In FOCS'83, pages 34-39, 1983.
15. A. Huima. Efficient infinite-state analysis of security protocols. In Workshop on Formal Methods and Security Protocols (FMSP'99), 1999.
16. R. Küsters. On the decidability of cryptographic protocols with open-ended data structures. In CONCUR 2002, LNCS 2421, pages 515-530. Springer-Verlag, 2002.
17. C. Meadows. Open issues in formal methods for cryptographic protocol analysis. In DISCEX 2000, pages 237-250. IEEE Computer Society Press, 2000.
18. J. K. Millen and V. Shmatikov. Constraint solving for bounded-process cryptographic protocol analysis. In CCS 2001, pages 166-175. ACM Press, 2001.
19. M. Rusinowitch and M. Turuani. Protocol Insecurity with Finite Number of Sessions is NP-complete. In CSFW-14, pages 174-190, 2001.