Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Challenges in the Automated Verification of Security Protocols

  • Conference paper
Automated Reasoning (IJCAR 2008)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5195))

Included in the following conference series:

  • 974 Accesses

Abstract

The application area of security protocols raises several problems that are relevant to automated deduction. We describe in this note some of these challenges.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Abadi, M., Cortier, V.: Deciding knowledge in security protocols under equational theories. Theoretical Computer Science 367(1–2), 2–32 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  2. Abadi, M., Fournet, C.: Mobile values, new names, and secure communication. In: Proceedings of the 28th ACM Symposium on Principles of Programming Languages (POPL 2001), January 2001, pp. 104–115 (2001)

    Google Scholar 

  3. Abadi, M., Rogaway, P.: Reconciling two views of cryptography: the computational soundness of formal encryption. In: Watanabe, O., Hagiya, M., Ito, T., van Leeuwen, J., Mosses, P.D. (eds.) TCS 2000. LNCS, vol. 1872. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  4. Affeldt, R., Comon-Lundh, H.: First-order logic and security protocols (unpublished manuscript) (April 2008)

    Google Scholar 

  5. Anantharaman, S., Narendran, P., Rusinowitch, M.: Intruders with caps. In: Baader, F. (ed.) RTA 2007. LNCS, vol. 4533. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  6. Arapinis, M., Delaune, S., Kremer, S.: From one session to many: Dynamic tags for security protocols. Research Report LSV-08-16, Laboratoire Spécification et Vérification, ENS Cachan, France (May 2008)

    Google Scholar 

  7. Arnaud, M., Cortier, V., Delaune, S.: Combining algorithms for deciding knowledge in security protocols. In: Konev, B., Wolter, F. (eds.) FroCos 2007. LNCS (LNAI), vol. 4720. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  8. Basin, D., Ganzinger, H.: Automated complexity analysis based on ordered resolution. Journal of the Association of Computing Machinery 48(1), 70–109 (2001)

    MathSciNet  Google Scholar 

  9. Basin, D., Mödersheim, S., Viganò, L.: Constraint Differentiation: A New Reduction Technique for Constraint-Based Analysis of Security Protocols. In: Proceedings of CCS 2003, pp. 335–344. ACM Press, New York (2003)

    Chapter  Google Scholar 

  10. Basin, D., Mödersheim, S., Viganò, L.: Algebraic intruder deductions. In: Sutcliffe, G., Voronkov, A. (eds.) LPAR 2005. LNCS (LNAI), vol. 3835. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  11. Baudet, M.: Deciding security of protocols against off-line guessing attacks. In: Proceedings of the 12th ACM Conference on Computer and Communications Security (CCS 2005), Alexandria, Virginia, USA, November 2005, pp. 16–25. ACM Press, New York (2005)

    Chapter  Google Scholar 

  12. Baudet, M.: Sécurité des protocoles cryptographiques : aspects logiques et calculatoires. Thèse de doctorat, Laboratoire Spécification et Vérification, ENS Cachan, France (January 2007)

    Google Scholar 

  13. Baudet, M.: Yapa: Yet another protocol analyser (2008), http://www.lsv.ens-cachan.fr/~baudet/yapa/index.html

  14. Bernat, V., Comon-Lundh, H.: Normal proofs in intruder theories. In: Revised Selected Papers of the 11th Asian Computing Science Conference (ASIAN 2006). LNCS, vol. 4435. Springer, Heidelberg (2008)

    Google Scholar 

  15. Blanchet, B.: An Efficient Cryptographic Protocol Verifier Based on Prolog Rules. In: 14th IEEE Computer Security Foundations Workshop (CSFW-14), Cape Breton, Nova Scotia, Canada, June 2001, pp. 82–96. IEEE Computer Society, Los Alamitos (2001)

    Google Scholar 

  16. Blanchet, B.: An automatic security protocol verifier based on resolution theorem proving (invited tutorial). In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS (LNAI), vol. 3632. Springer, Heidelberg (2005)

    Google Scholar 

  17. Blanchet, B., Abadi, M., Fournet, C.: Automated verification of selected equivalences for security protocols. Journal of Logic and Algebraic Programming 75(1), 3–51 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  18. Blanchet, B., Podelski, A.: Verification of cryptographic protocols: Tagging enforces termination. Theoretical Computer Science 333(1–2), 67–90 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  19. Bursuc, S., Comon-Lundh, H., Delaune, S.: Deducibility constraints, equational theory and electronic money. In: Comon-Lundh, H., Kirchner, C., Kirchner, H. (eds.) Jouannaud Festschrift. LNCS, vol. 4600. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  20. Canetti, R., Rabin, T.: Universal composition with joint state. Cryptology ePrint Archive, report 2002/47 (November 2003)

    Google Scholar 

  21. Chevalier, Y., Küsters, R., Rusinowitch, M., Turuani, M.: Deciding the security of protocols with Diffie-Hellman exponentiation and products in exponents. In: Pandya, P.K., Radhakrishnan, J. (eds.) FSTTCS 2003. LNCS, vol. 2914. Springer, Heidelberg (2003)

    Google Scholar 

  22. Chevalier, Y., Küsters, R., Rusinowitch, M., Turuani, M.: An NP decision procedure for protocol insecurity with XOR. In: Eighteenth Annual IEEE Symposium on Logic in Computer Science (LICS) (2003)

    Google Scholar 

  23. Chevalier, Y., Küsters, R., Rusinowitch, M., Turuani, M.: Deciding the security of protocols with commuting public key encryption. In: Proc. Workshop on Automated Reasoning for Security Protocol Analysis (ARSPA). Electronic Notes in Theoretical Computer Science, vol. 125 (2004)

    Google Scholar 

  24. Chevalier, Y., Rusinowitch, M.: Combining Intruder Theories. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580. Springer, Heidelberg (2005)

    Google Scholar 

  25. Chevalier, Y., Rusinowitch, M.: Hierarchical Combination of Intruder Theories. In: Pfenning, F. (ed.) RTA 2006. LNCS, vol. 4098, pp. 108–122. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  26. H. Comon and V. Cortier. Tree automata with one memory, set constraints and cryptographic protocols. Theoretical Computer Science, 331(1):143–214, Feb. 2005.

    Article  MATH  MathSciNet  Google Scholar 

  27. Comon-Lundh, H., Cortier, V.: New decidability results for fragments of first-order logic and application to cryptographic protocols. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol. 2706. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  28. Comon-Lundh, H., Cortier, V.: Security properties: Two agents are sufficient. Science of Computer Programming 50(1-3), 51–71 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  29. Comon-Lundh, H., Delaune, S.: The finite variant property: How to get rid of some algebraic properties. In: Giesl, J. (ed.) RTA 2005. LNCS, vol. 3467. Springer, Heidelberg (2005)

    Google Scholar 

  30. Comon-Lundh, H., Treinen, R.: Easy intruder deductions. In: Dershowitz, N. (ed.) Verification: Theory and Practice. LNCS, vol. 2772. Springer, Heidelberg (2004)

    Google Scholar 

  31. Cortier, V., Delaitre, J., Delaune, S.: Safely composing security protocols. In: Arvind, V., Prasad, S. (eds.) FSTTCS 2007. LNCS, vol. 4855. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  32. Cortier, V., Delaune, S.: Deciding knowledge in security protocols for monoidal equational theories. In: Dershowitz, N., Voronkov, A. (eds.) LPAR 2007. LNCS (LNAI), vol. 4790. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  33. Cortier, V., Delaune, S., Lafourcade, P.: A survey of algebraic properties used in cryptographic protocols. Journal of Computer Security 14(1), 1–43 (2006)

    Google Scholar 

  34. Cortier, V., Rusinowitch, M., Zalinescu, E.: A resolution strategy for verifying cryptographic protocols with CBC encryption and blind signatures. In: 7th ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming (PPDP) (2005)

    Google Scholar 

  35. Delaune, S.: Easy intruder deduction problems with homomorphisms. Information Processing Letters 97(6), 213–218 (2006)

    Article  MathSciNet  Google Scholar 

  36. Delaune, S., Kremer, S., Ryan, M.D.: Coercion-resistance and receipt-freeness in electronic voting. In: Proceedings of the 19th Computer Security Foundations Workshop (CSFW), IEEE Computer Society Press, Los Alamitos (2006)

    Google Scholar 

  37. Delaune, S., Lafourcade, P., Lugiez, D., Treinen, R.: Symbolic protocol analysis for monoidal equational theories. Information and Computation 206, 312–351 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  38. Delaune, S., Lin, H.: Protocol verification via rigid/flexible resolution. In: Dershowitz, N., Voronkov, A. (eds.) LPAR 2007. LNCS (LNAI), vol. 4790, Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  39. Fermüller, C., Leitsch, A., Hustadt, U., Tamet, T.: Resolution decision procedure. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, ch. 25, vol. 2, pp. 1793–1849. North-Holland, Amsterdam (2001)

    Google Scholar 

  40. Huttel, H.: Deciding framed bisimulation. In: 4th International Workshop on Verification of Infinite State Systems INFINITY 2002, pp. 1–20 (2002)

    Google Scholar 

  41. Küsters, R., Tuengerthal, M.: Joint state theorems for public-key encryption and digital signature functionalities with local computations. In: Computer Security Foundations (CSF 2008) (2008)

    Google Scholar 

  42. Lowe, G.: An attack on the Needham-Schroeder public-key authentication protocol. Information Processing Letters 56(3), 131–133 (1996)

    Article  Google Scholar 

  43. Lowe, G.: Towards a completeness result for model checking of security protocols. Journal of Computer Security 7(1) (1999)

    Google Scholar 

  44. McAllester, D.: Automatic recognition of tractability in inference relations. J. ACM 40(2) (1993)

    Google Scholar 

  45. Meadows, C.: The NRL protocol analyzer: An overview. Journal of Logic Programming 26(2), 113–131 (1996)

    Article  MATH  Google Scholar 

  46. Millen, J., Shmatikov, V.: Symbolic protocol analysis with an Abelian group operator or Diffie-Hellman exponentiation. J. Computer Security (2005)

    Google Scholar 

  47. Millen, J.K., Ko, H.-P.: Narrowing terminates for encryption. In: Proc. Ninth IEEE Computer Security Foundations Workshop (CSFW) (1996)

    Google Scholar 

  48. Ramanujam, R., Suresh, S.P.: Tagging makes secrecy decidable with unbounded nonces as well. In: Pandya, P.K., Radhakrishnan, J. (eds.) FSTTCS 2003. LNCS, vol. 2914, pp. 363–374. Springer, Heidelberg (2003)

    Google Scholar 

  49. Rusinowitch, M., Turuani, M.: Protocol insecurity with finite number of sessions is np-complete. In: Proc. 14th IEEE Computer Security Foundations Workshop, Cape Breton, Nova Scotia (June 2001)

    Google Scholar 

  50. Weidenbach, C.: Towards an automatic analysis of security protocols in first-order logic. In: Ganzinger, H. (ed.) CADE 1999. LNCS (LNAI), vol. 1632, pp. 314–328. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Ecole Normale Supérieure de Cachan and, Research Center for Information Security, National Institute of Advanced, Industrial Science and Technology (AIST), Tokyo, Japan

    Hubert Comon-Lundh

Authors
  1. Hubert Comon-Lundh
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Alessandro Armando Peter Baumgartner Gilles Dowek

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Comon-Lundh, H. (2008). Challenges in the Automated Verification of Security Protocols. In: Armando, A., Baumgartner, P., Dowek, G. (eds) Automated Reasoning. IJCAR 2008. Lecture Notes in Computer Science(), vol 5195. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71070-7_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-71070-7_34

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-71069-1

  • Online ISBN: 978-3-540-71070-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation