Process calculi and the verification of security protocols

Authors

DOI:

https://doi.org/10.26636/jtit.2002.4.147

Keywords:

cryptographic protocols, Dolev-Yao model, observational equivalence, process calculi, spi calculus

Abstract

Recently there has been much interest towards using formal methods in the analysis of security protocols. Some recent approaches take advantage of concepts and techniques from the field of process calculi. Process calculi can be given a formal yet simple semantics, which permits rigorous definitions of such concepts as "attacker", "secrecy" and "authentication". This feature has led to the development of solid reasoning methods and verification techniques, a few of which we outline in this paper.

Downloads

Download data is not yet available.

References

[1] M. Abadi, "Secrecy by typing in security protocols", J. ACM, vol. 46, no. 5, pp. 749-786, 1999.
View in Google Scholar

[2] M. Abadi and B. Blanchet, "Analyzing security protocols with secrecy types and logic programs", in POPL'02. ACM Press, 2002.
View in Google Scholar

[3] M. Abadi and A. D. Gordon, "A calculus for cryptographic protocols: the spi-calculus", Inform. Comput., vol. 148, no. 1, pp. 1-70, 1999.
View in Google Scholar

[4] M. Abadi and A. D. Gordon, "A bisimulation method for cryptographic protocols", Nord. J. Comput., vol. 5, no. 4, pp. 267-303, 1998.
View in Google Scholar

[5] R. M. Amadio and S. Lugiez, "On the reachability problem in cryptographic protocols", in Proc. CONCUR'00, LNCS. Springer, 2000, vol. 1877 (full version: RR 3915, INRIA Sophia Antipolis).
View in Google Scholar

[6] D. Bolignano, "Towards a mechanization of cryptographic protocol verification", in International Conference on Computer Aided Verification, LNCS. Springer, 1997.
View in Google Scholar

[7] M. Boreale, "Symbolic trace analysis of cryptographic protocols", in ICALP'01, LNCS. Springer, 2001, vol. 2076, pp. 667-681.
View in Google Scholar

[8] M. Boreale and M. G. Buscemi, "Experimenting with STA, a tool for automatic analysis of security protocols", in ACM Symposium on Applied Computing 2002. ACM Press, 2002.
View in Google Scholar

[9] M. Boreale and R. De Nicola, "Testing equivalence for mobile processes", Inform. Comput., vol. 120, pp. 279-303, 1995.
View in Google Scholar

[10] M. Boreale, R. De Nicola, and R. Pugliese, "Proof techniques for cryptographic processes", in LICS'99, Proceedings. IEEE Computer Society Press, 1999, pp. 157-166 (full version to appear in SIAM J. Comput.).
View in Google Scholar

[11] M. Boreale and D. Gorla, "On compositional reasoning in the spi calculus", in FoSSaCS'02, Proceedings, M. Nielsen and H. U. Engberg, Eds., LNCS. Springer, 2000, vol. 2303, pp. 67-81.
View in Google Scholar

[12] M. Burrows, M. Abadi, and R. Needham, "A logic of authentication", ACM Trans. Comput. Syst., vol. 8, no. 1, pp. 18-36, 1990.
View in Google Scholar

[13] H. Comon, V. Cortier, and J. Mitchell, "Tree automata with one memory, set constraints and ping-pong protocols", in ICALP'01, LNCS. Springer, 2001, vol. 2076, pp. 682-693.
View in Google Scholar

[14] R. De Nicola and M. C. B. Hennessy, "Testing equivalence for processes", Theor. Comput. Sci., no. 34, pp. 83-133, 1984.
View in Google Scholar

[15] D. Dolev and A. Yao, "On the security of public-key protocols", IEEE Trans. Inform. Theory, vol. 2, no. 29, pp. 198-208, 1983.
View in Google Scholar

[16] N. Durgin, P. Lincoln, J. Mitchell, and A. Scedrov, "Undecidability of bounded security protocols", in Proc. FLOC Worksh. Form. Meth. Secur. Protoc., Trento, Italy, 1999.
View in Google Scholar

[17] A. D. Gordon and A. Jeffrey, "Authenticity by typing for security protocols", in 14th IEEE Comput. Secur. Found. Worksh., 2001, pp. 145-159.
View in Google Scholar

[18] J. Goubault-Larrecq, "A method for automatic cryptographic protocol verification", in Proc. 15th IPDPS Workshops, LNCS. Springer, 2000, vol. 1800, pp. 977-984.
View in Google Scholar

[19] A. Huima, "Efficient infinite-state analysis of security protocols", in Proc. FLOC Worksh. Form. Meth. Secur. Protoc., Trento, Italy, 1999.
View in Google Scholar

[20] J. Kohl and B. Neuman, "The Kerberos network authentication service (version 5)". Internet Request for Comment RFC-1510, 1993.
View in Google Scholar

[21] G. Lowe, "Breaking and fixing the Needham-Schroeder public-key protocol using FDR", in TACAS'96, Proceedings, T. Margaria and B. Steffen, Eds., LNCS. Springer, 1996, vol. 1055, pp. 147-166.
View in Google Scholar

[22] G. Lowe, "A hierarchy of authentication specifications", in Proc. 10th IEEE Computer of Security Foundations Workshop. IEEE Computer Society Press, 1997.
View in Google Scholar

[23] R. Milner, "The polyadic ?-calculus: a tutorial", in Logic and Algebra of Specification, F. L. Hamer, W. Brauer, and H. Schwichtenberg, Eds. Springer, 1993.
View in Google Scholar

[24] R. Milner, J. Parrow, and D. Walker, "A calculus of mobile processes (Part I and II)", Inform. Comput., vol. 100, pp. 1-77, 1992.
View in Google Scholar

[25] R. Milner and D. Sangiorgi, "Barbed bisimulation", in ICALP'92, Proceedings, W. Kuich, Ed., LNCS. Springer, 1992, vol. 623, pp. 685-695.
View in Google Scholar

[26] J. C. Mitchell, M. Mitchell, and U. Stern, "Automated analysis of cryptographic protocols using Mur ?", in Proceedings of Symposium Security and Privacy. IEEE Computer Society Press, 1997.
View in Google Scholar

[27] L. C. Paulson, "The inductive approach to verifying cryptographic protocols", J. Comput. Secur., no. 6, pp. 85-128, 1998.
View in Google Scholar

[28] D. Pointcheval, "Asymmetric cryptography and practical security", J. Telecommun. Inform. Technol., no. 4, pp. 41-56, 2002.
View in Google Scholar

[29] M. Rusinowitch and M Turuani, "Protocol insecurity with finite number of sessions in NP-complete", in 14th Computer Security Foundations Workshop. IEEE Computer Society Press, 2001
View in Google Scholar

Downloads

Published

2002-12-30

Issue

Section

RESEARCH ARTICLES

How to Cite

[1]
M. Boreale and D. Gorla, “Process calculi and the verification of security protocols”, JTIT, vol. 10, no. 4, pp. 28–40, Dec. 2002, doi: 10.26636/jtit.2002.4.147.