Abstract
This paper presents a non-uniform static analysis for SPIKY, an extension of the spi calculus with capabilities for PKI operations. The analysis, which follows a denotational framework, captures the property of term substitutions resulting from communications, cryptographic and PKI capabilities. The results of the analysis are used to formalise definitions of two security properties: the term secrecy and (un)certified peer-entity participation.
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.: A calculus for cryptographic protocols: The spi calculus. In: Proceedings of the 4th ACM Conference on Computer and Communications Security, Zurich, Switzerland, April 1997, pp. 36–47. ACM Press, New York (1997)
Abramsky, S.: A domain equation for bisimulation. Information and Computation 92(2), 161–218 (1991)
Aziz, B.: A Static Analysis Framework for Security Properties in Mobile and Cryptographic Systems. PhD thesis, School of Computing, Dublin City University, Dublin (2003)
Aziz, B., Hamilton, G.W., Gray, D.: A denotational approach to the static analysis of cryptographic processes. In: Proceedings of International Workshop on Software Verification and Validation, Mumbai, India, December 2003, vol. 118, pp. 19–36 (2003)
Aziz, B., Hamilton, G.: A privacy analysis for the π-calculus: The denotational approach. In: Proceedings of the 2nd Workshop on the Specification, Analysis and Validation for Emerging Technologies, Copenhagen, Denmark, July 2002. Datalogiske Skrifter, vol. 94, Roskilde University (2002)
Aziz, B., Hamilton, G., Gray, D.: A static analysis of cryptographic processes: The denotational approach. Journal of Logic and Algebraic Programming 64(2), 285–320 (2005)
Gray, D., Aziz, B., Hamilton, G.: Spiky: A nominal calculus for modelling protocols that use pkis. In: Proceedings of the International Workshop on Security Analysis of Systems: Formalism and Tools, Orléans, France (June 2004)
Plotkin, G.: A powerdomain construction. SIAM Journal on Computing 5(3), 452–487 (1976)
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
Aziz, B., Gray, D., Hamilton, G. (2005). A Static Analysis of PKI-Based Systems. In: Coppo, M., Lodi, E., Pinna, G.M. (eds) Theoretical Computer Science. ICTCS 2005. Lecture Notes in Computer Science, vol 3701. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11560586_6
Download citation
DOI: https://doi.org/10.1007/11560586_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29106-0
Online ISBN: 978-3-540-32024-1
eBook Packages: Computer ScienceComputer Science (R0)