A static analysis of PKI-based systems

Authors:
Benjamin Aziz;David Gray;Geoff Hamilton
Affiliations:
Department of Computing, Imperial College, London, U.K.;School of Computing, Dublin City University, Dublin 9, Ireland;School of Computing, Dublin City University, Dublin 9, Ireland
Venue:
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Year:
2005

Citing 3
Cited 1

A calculus for cryptographic protocols: the spi calculus

Proceedings of the 4th ACM conference on Computer and communications security
A Denotational Approach to the Static Analysis of Cryptographic Processes

Electronic Notes in Theoretical Computer Science (ENTCS)
A domain equation for bisimulation

Information and Computation

A Semiring-based Quantitative Analysis of Mobile Systems

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

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.