A Calculus for Concurrent Processes with Cryptographic Primitives


Article Preview

We introduce cryptographic primitives to the symbolic transition graph with the binary equivalence relation based on the CCS language with value-passing processes, which is designed for the description and analysis of security protocols. The STGR with cryptographic primitives, which is an extension of the STG, is applied to partition domains of conversations of security protocols that run in an infinite concurrent way, where principals possessing their relevant keys have received and transformed the message. The cryptographic primitives enable us to consider cryptographic issues on the principal conversations of security protocols in more detail. Our work results in a highly efficient solution to reduce computational complexities to prove safety properties of security protocols.



Edited by:

D.L. Liu, X.B. Zhu, K.L. Xu and D.M. Fang




H. B. Wang, "A Calculus for Concurrent Processes with Cryptographic Primitives", Applied Mechanics and Materials, Vols. 513-517, pp. 3397-3400, 2014

Online since:

February 2014





* - Corresponding Author

[1] F. Javier Thayer Fábrega, Jonathan C. Herzog, and Joshua D. Guttman: Strand spaces: proving security protocols correct. Journal of Computer Security, Vol. 7 (1999), pp.191-230.

DOI: https://doi.org/10.3233/jcs-1999-72-304

[2] Joshua D. Guttman, and F. Javier Thayer: Authentication tests and the structure of bundles. Theoretical Computer Science, Vol. 283 (2002), pp.333-380.

DOI: https://doi.org/10.1016/s0304-3975(01)00139-6

[3] Milner, R.: Communicating and Mobile Systems: the π-Calculus. Computer Laboratory, University of Cambridge, Cambridge University Press, (1999).

[4] Hennessy M., Lin H.: Symbolic Bisimulations. Theoretical Computer Science, Vol. 138 (1995), pp.353-389.

DOI: https://doi.org/10.1016/0304-3975(94)00172-f

[5] Milner, R.: The space and motion of communicating agents. Cambridge University Press, (2009).

[6] Wang Huanbao, Zhang Yousheng, and Li Yuan: A diagram of strand spaces for security protocols. Journal of Computer Research and Development, Vol. 43 (2006), p.2062-(2068).

DOI: https://doi.org/10.1360/crad20061205

[7] Crazzolara F., Winskel G.: Events in security protocols. In: Proc. of the 8th ACM Conference on Computer and Communications Security, Philadelphia. ACM Press, (2001).

DOI: https://doi.org/10.1145/501983.501998

[8] Hennessy M. and Lin H.: Proof systems for message-passing process algebras. Formal Aspects of Computing, Vol. 8 (1996), pp.397-407.

DOI: https://doi.org/10.1007/bf01213531