Skip to main content
SpringerLink
Log in

Recursion Versus Replication in Simple Cryptographic Protocols

  • Conference paper
SOFSEM 2005: Theory and Practice of Computer Science (SOFSEM 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3381))

Abstract

We use some recent techniques from process algebra to draw several conclusions about the well studied class of ping-pong protocols introduced by Dolev and Yao. In particular we show that all nontrivial properties, including reachability and equivalence checking wrt. the whole van Glabbeek’s spectrum, become undecidable for a very simple recursive extension of the protocol. The result holds even if no nondeterministic choice operator is allowed. We also show that the extended calculus is capable of an implicit description of the active intruder, including full analysis and synthesis of messages in the sense of Amadio, Lugiez and Vanackère. We conclude by showing that reachability analysis for a replicative variant of the protocol becomes decidable.

Note: full proofs are available in [11].

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

Access this chapter

Log in via an institution
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. Abadi, M., Gordon, A.D.: A bisimulation method for cryptographic protocols. Nordic Journal of Computing 5(4), 267–303 (1998)

    MATH  MathSciNet  Google Scholar 

  2. Amadio, R.M., Charatonik, W.: On name generation and set-based analysis in the Dolev-Yao model. In: Brim, L., Jančar, P., Křetínský, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol. 2421, pp. 499–514. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  3. Amadio, R.M., Lugiez, D.: On the reachability problem in cryptographic protocols. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, pp. 380–394. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  4. Amadio, R.M., Lugiez, D., Vanackère, V.: On the symbolic reduction of processes with cryptographic functions. TCS 290(1), 695–740 (2002)

    Article  Google Scholar 

  5. Boreale, M.: Symbolic trace analysis of cryptographic protocols. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 667–681. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  6. Dolev, D., Even, S., Karp, R.M.: On the security of ping-pong protocols. Information and Control 55(1–3), 57–68 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  7. Dolev, D., Yao, A.C.: On the security of public key protocols. Transactions on Information Theory  IT-29(2), 198–208 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  8. Durgin, N., Lincoln, P., Mitchell, J., Scedrov, A.: Undecidability of bounded security protocols. In: Heintze, N., Clarke, E. (eds.) Proc. of FMSP 1999 (1999)

    Google Scholar 

  9. Fiore, M., Abadi, M.: Computing symbolic models for verifying cryptographic protocols. In: Proc. of CSFW 2001, pp. 160–173. IEEE, Los Alamitos (2001)

    Google Scholar 

  10. Focardi, R., Gorrieri, R., Martinelli, F.: Non interference for the analysis of cryptographic protocols. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol. 1853, pp. 354–372. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  11. Hüttel, H., Srba, J.: Recursion vs. replication in simple cryptographic protocols. Technical Report RS-04-23, BRICS Research Series (2004)

    Google Scholar 

  12. Hüttel, H., Srba, J.: Recursive ping-pong protocols. In: Proc. of WITS 2004, pp. 129–140 (2004)

    Google Scholar 

  13. Křetínský, M., Řehák, V., Strejček, J.: Extended process rewrite systems: Expressiveness and reachability. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 355–370. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  14. Rusinowitch, M., Turuani, M.: Protocol insecurity with a finite number of sessions and composed keys is NP-complete. TCS, 299 (2003)

    Google Scholar 

  15. van Glabbeek, R.J.: The linear time - branching time spectrum I: The semantics of concrete, sequential processes. In: Handbook of Process Algebra, ch. 1, pp. 3–99. Elsevier Science, Amsterdam (2001)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. BRICS, Department of Computer Science, University of Aalborg, Fredrik Bajersvej 7B, 9220, Aalborg East, Denmark

    Hans Hüttel & Jiří Srba

Authors
  1. Hans Hüttel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jiří Srba
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Charles University, Prague, Czech Republic

    Peter Vojtáš

  2. Institute of Informatics and Software Engineering Faculty of Informatics and Information technologies, Slovak University of Technology, Ilkovičova 3, 842 16, Bratislava,  

    Mária Bieliková

  3. STIX, École Polytechnique, 91128, Palaiseau Cedex, France

    Bernadette Charron-Bost

  4. Department of Computer Science, University of Loughborough, Loughborough, UK

    Ondrej Sýkora

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hüttel, H., Srba, J. (2005). Recursion Versus Replication in Simple Cryptographic Protocols. In: Vojtáš, P., Bieliková, M., Charron-Bost, B., Sýkora, O. (eds) SOFSEM 2005: Theory and Practice of Computer Science. SOFSEM 2005. Lecture Notes in Computer Science, vol 3381. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30577-4_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30577-4_21

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-30577-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation