Automata-based analysis of recursive cryptographic protocols

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

Volumn 2996, Issue , 2004, Pages 382-393

  Küsters, Ralf ^a   Wilke, Thomas ^b  

^a STANFORD UNIVERSITY   (United States)

^b UNIVERSITY OF KIEL   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTABILITY AND DECIDABILITY; CRYPTOGRAPHY;

CRYPTOGRAPHIC PROTOCOLS; DOLEV-YAO INTRUDERS; GROUP PROTOCOLS; KEY GENERATION; RECURSIVE COMPUTATION; RECURSIVE PROTOCOLS; TREE TRANSDUCERS; UNDECIDABILITY;

NETWORK SECURITY;

EID: 35048832860     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24749-4_34     Document Type: Article

References (25)

1. N. Alon, T. Milo, F. Neven, D. Suciu, and V. Vianu. XML with Data Values: Typechecking Revisited. In JCSS 66(4): 688-727 (2003).
2. R.M. Amadio and W. Charatonik. On Name Generation and Set-Based Analysis in the Dolev-Yao Model. In CONCUR 2002.
3. R.M. Amadio, D. Lugiez, and V. Vanackere. On the symbolic reduction of processes with cryptographic functions. Theoretical Computer Science, 290(1):695-740, 2002.
4. M. Bellare and P. Rogaway. Provably secure session key distribution: the three party case. In STOC'95, pages 57-66. ACM, 1995.
5. M. Boreale. Symbolic trace analysis of cryptographic protocols. In ICALP 2001, pages 667-681. Springer, 2001.
6. J. Bryans and S.A. Schneider. CSP, PVS, and a Recursive Authentication Protocol. In DIM ACS Workshop on Formal Verification of Security Protocols, 1997.
7. J.A. Bull and D.J. Otway. The authentication protocol. Technical Report DRA/CIS3/PROJ/CORBA/SC/1/CSM/436-04/03, Defence Research Agency, Malvern, UK, 1997.
8. Y. Chevalier, R. Küsters, M. Rusinowitch, and M. Turuani. An NP Decision Procedure for Protocol Insecurity with XOR. In LICS 2003.
9. Y. Chevalier, R. Küsters, M. Rusinowitch, and M. Turuani. Deciding the Security of Protocols with Diffie-Hellman Exponentiation and Products in Exponents. In FSTTCS 2003.
10. J. Clark and J. Jacob. A Survey of Authentication Protocol Literature, 1997. Web Draft Version 1.0 available from http://citeseer.nj.nec.com/.
11. H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree Automata Techniques and Applications, 1997. Available from http://www.grappa.univ-lille3.fr/tata.
12. H. Comon-Lundh and V. Shmatikov. Intruder deductions, constraint solving and insecurity decision in presence of exclusive or. In LICS 2003.
13. D. Dolev and A.C. Yao. On the Security of Public-Key Protocols. IEEE Transactions on Information Theory, 29(2): 198-208, 1983.
14. N. Ferguson and B. Schneier. A Cryptographic Evaluation of IPsec. Technical report, 2000. Available from http://www.counterpane.com/ipsec.pdf.
15. R. Küsters. On the decidability of cryptographic protocols with open-ended data structures. In CONCUR SOUS, LNCS 2421, pages 515-530. Springer, 2002.
16. R. Küsters and Th. Wilke. Automata-based Analysis of Recursive Cryptographic Protocols. Technical Report IFI 0311, CAU Kiel, 2003. Available from http://www.informatik.uni-kiel.de/reports/2003/0311.html
17. C. Meadows. Extending formal cryptographic protocol analysis techniques for group protocols and low-level cryptographic primitives. In WITS 2000.
18. C. Meadows. Open issues in formal methods for cryptographic protocol analysis. In DISCEX 2000, pages 237-250. IEEE Computer Society Press, 2000.
19. J. K. Millen and V. Shmatikov. Constraint solving for bounded-process cryptographic protocol analysis. In CCS 2001, pages 166-175. ACM Press, 2001.
20. F. Neven, Th. Schwentick, and V. Vianu. Towards regular languages over infinite alphabets. In MFCS 2001, LNCS 2136, pages 560-572. Springer, 2001.
21. L.C. Paulson. Mechanized Proofs for a Recursive Authentication Protocol. In CSFW-10, pages 84-95. IEEE Computer Society Press, 1997.
22. O. Pereira and J.-J. Quisquater. A Security Analysis of the Cliques Protocols Suites. In CSFW-14, pages 73-81. IEEE Computer Society Press, 2001.
23. M. Rusinowitch and M. Turuani. Protocol Insecurity with Finite Number of Sessions is NP-complete. In CSFW-14, pages 174-190. 2001.
24. H. Seidl. Haskell overloading is DEXPTIME-complete. Information Processing Letters, 52(2), 1994.
25. J. Zhou. Fixing a security flaw in IKE protocols. Electronic Letter, 35(13):10721073, 1999.