Skip to main content

Deciding the Security of Protocols with Diffie-Hellman Exponentiation and Products in Exponents

  • Conference paper
FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2003)

Abstract

We present an NP decision procedure for the formal analysis of protocols in presence of modular exponentiation with products allowed in exponents. The number of factors that may appear in the products is unlimited. We illustrate that our model is powerful enough to uncover known attacks on the A-GDH.2 protocol suite.

This work was partially supported by PROCOPE and IST AVISPA. The second author was also supported by the DFG.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Amadio, R., Lugiez, D., Vanackere, V.: On the symbolic reduction of processes with cryptographic functions. Theoretical Computer Science 290(1), 695–740 (2002)

    Article  MathSciNet  Google Scholar 

  2. Bockmayr, A., Weispfenning, V.: Solving numerical constraints. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, ch. 12, vol.1, pp. 751–842. Elsevier Science, Amsterdam (2001)

    Chapter  Google Scholar 

  3. Boreale, M., Buscemi, M.G.: On the symbolic analysis of low-level cryptographic primitives: Modular exponentiation and the Diffie-Hellman protocol. In: Proc. of FCS 2003 (2003)

    Google Scholar 

  4. Chevalier, Y., Küsters, R., Rusinowitch, M., Turuani, M.: Deciding the Security of Protocols with Diffie-Hellman Exponentiation and Products in Exponents. Technical Report 0305, CAU Kiel, Germany (2003), Available from http://www.informatik.uni-kiel.de/reports/2003/0305.html

  5. Chevalier, Y., Küsters, R., Rusinowitch, M., Turuani, M.: An NP Decision Procedure for Protocol Insecurity with XOR. In: Proc. of LICS 2003 (2003)

    Google Scholar 

  6. Comon-Lundh, H., Shmatikov, V.: Intruder deductions, constraint solving and insecurity decision in presence of exclusive. In: Proc. of LICS 2003 (2003)

    Google Scholar 

  7. Meadows, C., Narendran, P.: A unification algorithm for the group Diffie- Hellman protocol. In: Proc. of WITS 2002 (2002)

    Google Scholar 

  8. Millen, J., Shmatikov, V.: Symbolic protocol analysis with products and Diffie- Hellman exponentiation. In: Proc. of CSFW 16 (2003)

    Google Scholar 

  9. Pereira, O., Quisquater, J.-J.: A Security Analysis of the Cliques Protocols Suites. In: Proc. of CSFW-14, pp. 73–81 (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chevalier, Y., Küsters, R., Rusinowitch, M., Turuani, M. (2003). Deciding the Security of Protocols with Diffie-Hellman Exponentiation and Products in Exponents. In: Pandya, P.K., Radhakrishnan, J. (eds) FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2003. Lecture Notes in Computer Science, vol 2914. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24597-1_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24597-1_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20680-4

  • Online ISBN: 978-3-540-24597-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics