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.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Abadi, M., Gordon, A.D.: A bisimulation method for cryptographic protocols. Nordic Journal of Computing 5(4), 267–303 (1998)
Abadi, M., Gordon, A.D.: A calculus for cryptographic protocols: The spi calculus. Information and Computation 148(1), 1–70 (1999)
Boreale, M., De Nicola, R., Pugliese, R.: Proof techniques for cryptographic processes. SIAM Journal on Computing 31(3), 947–986 (2002)
Borgström, J., Nestmann, U.: On bisimulations for the spi-calculus. Technical Report, EPFL, Switzerland (2003)
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)
Clarke Jr., E.M., Grumberg, O., Peled, D.A.: Model Checking, pp. 61–87. MIT Press, Cambridge (1999)
Fiore, M., Abadi, M.: Computing symbolic models for verifying cryptographic protocols. In: Proc. of 14th IEEE CSFW, pp. 160–173 (2001)
Hoare, C.: Commnunicating Sequential Processes. Prentice-Hall International, Englewood Cliffs (1985)
Hennessy, M., Lin, H.: Symbolic bisimulations. Theoretical Computer Science 138, 353–389 (1995)
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)
Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes, I and II. Information and Computation 100(1), 1–77 (1992)
Milner, R.: Communication and Concurrency. Prentice-Hall International, Englewood Cliffs (1989)
Schneider, S.: Verifying authentication protocols in CSP. IEEE Tran. Softw. Eng. 24(9), 741–758 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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)