Deciding key cycles for security protocols

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

Volumn 4246 LNAI, Issue , 2006, Pages 317-331

  Cortier, Véronique ^a   Zǎlinescu, Eugen ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; SECURITY OF DATA;

COMPUTATIONAL CRYPTOGRAPHY; SECURITY PROTOCOLS;

CRYPTOGRAPHY;

EID: 33845189681     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11916277_22     Document Type: Conference Paper

References (27)

1. M. Abadi and Ph. Rogaway. Reconciling two views of cryptography (the computational soundness of formal encryption). Journal of Cryptology, 2:103-127, 2002.
2. P. Adlo, G. Bana, J. Herzog, and A. Scedrov. Soundness of formal encryption in the presence of key-cycles. In Proc. 10th European Symposium on Research in Computer Security (ESORICS'05), volume 3679 of LNCS, pages 374-396, 2005.
3. A. Armando, D. Basin, Y. Boichut, Y. Chevalier, L. Compagna, J. Cuellar, P. Hankes Drielsma, P.C. Héam, O. Kouchnarenko, J. Mantovani, S. Mödersheim, D. von Oheimb, M. Rusinowitch, J. Santiago, M. Turuani, L. Viganò, and L. Vigneron. The Avispa tool for the automated validation of internet security protocols and applications. In Proc. of Computer Aided Verification (CAV'05), volume 3576 of LNCS, 2005.
4. M. Backes and B. Pfitzmann. Symmetric encryption in a simulatable Dolev-Yao style cryptographic library. In Proc. 17th IEEE Computer Science Foundations Workshop (CSFW'04), pages 204-218, 2004.
5. M. Backes, B. Pfitzmann, and A. Scedrov. Key-dependent message security under active attacks. Cryptology ePrint Archive, Report 2005/421, 2005.
6. M. Bellare and P. Rogaway. Entity authentication and key distribution. In Advances in Cryptology - Crypto '93, 13th Annual International Cryptology Conference, volume 773 of LNCS, pages 232-249, 1993.
7. B. Blanchet. An efficient cryptographic protocol verifier based on Prolog rules. In Proc. 14th IEEE Computer Security Foundations Workshop (CSFW'01), pages 82-96, 2001.
8. B. Blanchet and A. Podelski. Verification of cryptographic protocols: Tagging enforces termination. In Andrew Gordon, editor, Foundations of Software Science and Computation Structures (FoSSaCS'03), volume 2620 of LNCS, April 2003.
9. L. Bozga, C. Ene, and Y. Lakhnech. A symbolic decision procedure for cryptographic protocols with time stamps. In Proc. 15th International Conference on Concurrency Theory (CONCUR'04), LNCS, pages 177-192, London, England, 2004. Springer-Verlag.
10. J. Clark and J. Jacob. A survey of authentication protocol literature. Available at http://www.cs.york.ac.uk/~jac/papers/drareviewps.ps, 1997.
11. H. Comon-Lundh. Résolution de contraintes et recherche d'attaques pour un nombre borné de sessions. Available at http://www.lsv.ens-cachan. fr/~comon/CRYPTO/bounded.ps.
12. H. Comon-Lundh and V. Cottier. New decidability results for fragments of first-order logic and application to cryptographic protocols. In Proc. of the 14th Int. Conf. on Rewriting Techniques and Applications (RTA'2003), volume 2706 of LNCS, pages 148-164. Springer-Verlag, June 2003.
13. H. Comon-Lundh and V. Shmatikov. Intruder deductions, constraint solving and insecurity decision in presence of exclusive or. In Proc. of 18th Annual IEEE Symposium on Logic in Computer Science (LICS '03), pages 271-280, 2003.
14. V. Corder and E. Zǎlinescu. Deciding key cycles for security protocols, extended version. Available at http://www.loria.fr/~zalinesc/papers/ cz_keycycles.ps.
15. N. Durgin, P. Lincoln, J. Mitchell, and A. Scedrov. Undecidability of bounded security protocols. In Proc. of the Workshop on Formal Methods and Security Protocols, 1999.
16. S. Goldwasser and S. Micali. Probabilistic encryption. Journal of Computer and System Sciences, 28:270-299, 1984.
17. R. Janvier, Y. Lakhnech, and L. Mazare. (De)Compositions of Cryptographic Schemes and their Applications to Protocols. Cryptology ePrint Archive, Report 2005/020, 2005.
18. P. Laud. Encryption cycles and two views of cryptography. In Nordic Workshop on Secure IT Systems (NORDSEC'02), 2002.
19. G. Lowe. Breaking and fixing the Needham-Schroeder public-key protocol using FDR. In Tools and Algorithms for the Construction and Analysis of Systems (TACAS'96), volume 1055 of LNCS, pages 147-166. Springer-Verlag, March 1996.
20. G. Lowe. A hierarchy of authentication specification. In 10th Computer Security Foundations Workshop (CSFW '97), pages 31-44, 1997.
21. D. Micciancio and B. Warinschi. Soundness of formal encryption in the presence of active adversaries. In Proc. 1st Theory of Cryptography Conference (TCC'04), volume 2951 of LNCS, pages 133-151, 2004.
22. J. K. Millen and V. Shmatikov. Constraint solving for bounded-process cryptographic protocol analysis. In Proc. 8th ACM Conference on Computer and Communications Security (CCS'01), pages 166-175, 2001.
23. R. M. Needham and M. D. Schroeder. Using encryption for authentication in large networks of computers. Commun. ACM, 21(12):993-999, 1978.
24. R. Ramanujam and S. P. Suresh. Tagging makes secrecy decidable for unbounded nonces as well. In Proc. of the 23rd Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'03), Mumbai, 2003.
25. M. Rusinowitch and M. Turuani. Protocol insecurity with finite number of sessions and composed keys is NP-complete. Theoretical Computer Science, 299:451-475, 2003.
26. A. Schrijver. Theory of Linear and Integer Programming. Wiley, 1998.
27. K. N. Verma, H. Seidl, and T. Schwentick. On the complexity of equational Horn clauses. In Proc. of the 22th International Conference on Automated Deduction (CADE 2005), Lecture Notes in Computer Science, pages 337-352. Springer-Verlag, 2005.