Skip to main content
SpringerLink
Log in

Towards a Symbolic Bisimulation for the Spi Calculus

  • Conference paper
Book cover Mobile Ad-hoc and Sensor Networks (MSN 2005)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 3794))

Included in the following conference series:

  • 777 Accesses

Abstract

Observational equivalence is a powerful means for formulating the security properties of cryptographic protocols. However suffering from the infinite quantifications over contexts, its proof becomes notoriously troublesome. This paper addresses the problem with a symbolic technique. We propose a symbolic bisimulation for spi calculus based on an environmental sensitive label transition system semantics, which restrict the infinite inputs of a process to only finite transitions. We also prove that the symbolic bisimulation is sound to the traditional concrete bisimulation, and furthermore is a promising means to automatically verifying the security protocols.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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. Abadi, M., Gordon, A.D.: A calculus for cryptographic protocols: The spi calculus. Information and Computation 148(1), 1–70 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  3. Boreale, M., De Nicola, R., Pugliese, R.: Proof techniques for cryptographic processes. SIAM Journal on Computing 31(3), 947–986 (2002)

    Article  MATH  Google Scholar 

  4. Borgström, J., Nestmann, U.: On bisimulations for the spi-calculus. Technical Report, EPFL, Switzerland (2003)

    Google Scholar 

  5. Borgström, J., Briais, S., Nestmann, U.: Symbolic bisimulations in the spi calculus. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 161–176. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  6. Clarke Jr., E.M., Grumberg, O., Peled, D.A.: Model Checking, pp. 61–87. MIT Press, Cambridge (1999)

    Google Scholar 

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

    Google Scholar 

  8. Hoare, C.: Commnunicating Sequential Processes. Prentice-Hall International, Englewood Cliffs (1985)

    Google Scholar 

  9. Hennessy, M., Lin, H.: Symbolic bisimulations. Theoretical Computer Science 138, 353–389 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  10. Lü, Y.H., Gu, Y.G., Chen, X.R., Fu, Y.: Analyzing security protocols by a bisimulation method based on environmental knowledge. In: Proc. of ICCCAS 2005, pp. 79–83 (2005)

    Google Scholar 

  11. Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes, I and II. Information and Computation 100(1), 1–77 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  12. Milner, R.: Communication and Concurrency. Prentice-Hall International, Englewood Cliffs (1989)

    MATH  Google Scholar 

  13. Schneider, S.: Verifying authentication protocols in CSP. IEEE Tran. Softw. Eng. 24(9), 741–758 (1998)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Guizhou University, Guiyang, 550025, China

    Yinhua Lü & Xiaorong Chen

  2. School of Information Science and Technology, Zhejiang Forestry University, Lin’an, 311300, China

    Luming Fang & Hangjun Wang

Authors
  1. Yinhua Lü
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xiaorong Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Luming Fang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Hangjun Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, City University of Hong Kong,  

    Xiaohua Jia

  2. College of Optoelectric and Electric Information Engineering, University of Shanghai for Science and Technology, 200093, Shanghai, P.R. China

    Jie Wu

  3. School of Computer, Wuhan University, 430072, Wuhan, China

    Yanxiang He

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lü, Y., Chen, X., Fang, L., Wang, H. (2005). Towards a Symbolic Bisimulation for the Spi Calculus. In: Jia, X., Wu, J., He, Y. (eds) Mobile Ad-hoc and Sensor Networks. MSN 2005. Lecture Notes in Computer Science, vol 3794. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11599463_108

Download citation

  • DOI: https://doi.org/10.1007/11599463_108

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30856-0

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation