Abstract
Testing equivalence is a quite powerful way of expressing security properties of cryptographic protocols, but its formal verification is a difficult task, because it is based on the universal quantification over contexts. A technique based on state exploration to address this verification problem has been previously presented; it relies on an environment-sensitive labelled transition system (ES-LTS) and on symbolic term representation. This paper shows that such a technique can be enhanced by exploiting symmetries found in the ES-LTS structure. Experimental results show that the proposed enhancement can substantially reduce the size of the ES-LTS and that the technique as a whole compares favorably with respect to related work.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abadi, M., Gordon, A.D.: A bisimulation method for cryptographic protocols. Nordic J. Comput. 5(4), 267–303 (1998)
Abadi, M., Gordon, A.D.: A calculus for cryptographic protocols the spi calculus. SRC - Research Report 149, Digital System Research Center (1998)
Bellare, M., Garay, J., Hauser, R., Herberg, A., Krawczyk, H., Steiner, M., Tsudik, G., Waidner, M.: iKP - A family of secure electronic payment protocols. In: Proceedings of the 1st USENIX Workshop on Electronic Commerce, Berkeley, CA, pp. 157–166. USENIX Assoc. (1995)
Boreale, M., De Nicola, R., Pugliese, R.: Proof techniques for cryptographic processes. SIAM J. Comput. 31(3), 947–986 (2002)
Burrows, M., Abadi, M., Needham, R.: A logic of authentication. Proceedings of the Royal Society, Series A 426, 233–271 (1871)
Cibrario Bertolotti, I., Durante, L., Sisto, R., Valenzano, A.: A new knowledge representation strategy for cryptographic protocol analysis. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619, pp. 284–298. Springer, Heidelberg (2003)
Cibrario Bertolotti, I., Durante, L., Sisto, R., Valenzano, A.: Symmetry-based reduction for testing equivalence in the spi calculus. Technical Report DAI/ARC 1-04, Politecnico di Torino (2004)
Clarke, E.M., Jha, S., Marrero, W.: Partial order reductions for security protocol verification. In: Schwartzbach, M.I., Graf, S. (eds.) TACAS 2000. LNCS, vol. 1785, p. 503. Springer, Heidelberg (2000)
Clarke, E.M., Jha, S., Marrero, W.: Verifying security protocols with Brutus. ACM Trans. Softw. Eng. Meth. 9(4), 443–487 (2000)
Durante, L., Sisto, R., Valenzano, A.: Automatic testing equivalence verification of spi calculus specifications. ACM Trans. Softw. Eng. Meth. 12(2), 222–284 (2003)
Fiore, M., Abadi, M.: Computing symbolic models for verifying cryptographic protocols. In: Proceedings of the 14th IEEE Computer Security Foundations Workshop (CSFW 2001), Washington, pp. 160–173. IEEE Computer Society Press, Los Alamitos (2001)
Gnesi, S., Latella, D., Lenzini, G.: A BRUTUS logic for the Spi-Calculus. In: Proceedings of WITS 2002 (2002)
Jensen, K.: Coloured Petri nets: basic concepts, analysis methods and practical use. Springer, Berlin (1995)
Lowe, G.: Breaking and fixing the Needham-Schroeder public-key protocol using FDR. In: Margaria, T., Steffen, B. (eds.) TACAS 1996. LNCS, vol. 1055, pp. 147–166. Springer, Heidelberg (1996)
Lowe, G.: Some new attacks upon security protocols. In: Proceedings of the 9th IEEE Computer Security Foundations Workshop (CSFW 1996), Washington, pp. 162–169. IEEE Computer Society Press, Los Alamitos (1996)
Lowe, G.: Casper: a compiler for the analysis of security protocols. In: Proceedings of the 10th IEEE Computer Security Foundations Workshop (CSFW 1997), Washington, pp. 18–30. IEEE Computer Society Press, Los Alamitos (1997)
Millen, J.K., Clark, S.C., Freedman, S.B.: The Interrogator: Protocol security analysis. IEEE Trans. Softw. Eng. 13(2), 274–288 (1987)
Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes, parts I and II. Inf. Comput. 100(1), 1–77 (1992)
Needham, R., Schroeder, M.: Using encryption for authentication in large networks of computers. Communications of the ACM 21(12), 993–999 (1978)
Paulson, L.C.: The inductive approach to verifying cryptographic protocols. J. Comput. Sec. 6, 85–128 (1998)
Schneider, S.: Verifying authentication protocols in CSP. IEEE Trans. Softw. Eng. 24(9), 741–758 (1998)
Sistla, A.P., Gyuris, V., Emerson, E.A.: Smc: A symmetry-based model checker for verification of safety and liveness properties. ACM Trans. Softw. Eng. Meth. 9(2), 133–166 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cibrario B., I., Durante, L., Sisto, R., Valenzano, A. (2004). Exploiting Symmetries for Testing Equivalence in the Spi Calculus. In: Wang, F. (eds) Automated Technology for Verification and Analysis. ATVA 2004. Lecture Notes in Computer Science, vol 3299. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30476-0_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-30476-0_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23610-8
Online ISBN: 978-3-540-30476-0
eBook Packages: Springer Book Archive