We propose PS-LTL, a pure-past security linear temporal logic that allows the specification of a variety of authentication, secrecy and data freshness properties. Furthermore, we present a sound and complete decision procedure to establish the validity of security properties for symbolic execution traces, and show the integration with constraint-based analysis techniques

Corin, R.J.

Etalle, S.

Saptawijaya, A.

English

Pure OAI Repository

A logic for constraint-based security protocol analysis

Etalle, Sandro

University of Twente Research Information

A Logic for Constraint-based Security Protocol Analysis

Abstract. Several formal approaches have been proposed to analyse security protocols, e.g. [2,7,11,1,6,12]. Recently, a great interest has been growing on the use of constraint solving approach. Initially proposed by Millen and Shmatikov [9], this approach allows analysis of a finite number of protocol sessions. Yet, the representation of protocol runs by symbolic traces (as opposed to concrete traces) captures the possibility of having unbounded message space, allowing analysis over an infinite state space. A constraint is defined as a pair consisting of a message M and a set of messages K that represents the intruder’s knowledge. Millen and Shmatikov present a procedure to solve a set of constraints, i.e. that in each constraint, M can be built from K. When a set of constraints is solved, then a concrete trace representing an attack over the protocol can be extracted. Corin and Etalle [4] has improved the work of Millen and Shmatikov by presenting a more efficient procedure. However, none of thes

Ricardo Corin

Ari Saptawijaya

Ro Etalle

CiteSeerX

NARCIS 

A formal framework and evaluation method for network denial of service.

A formal language for cryptographic protocol requirements.

A hierarchy of authentication speciﬁcations.

A logic of authentication.

A Survey of Authentication Protocol Literature: Version 1.0.

A survey of authentication protocol literature: Version 1.0. http://www.cs.york.ac.uk/ ∼jac/papers/drareview.ps.gz,

A theory of dictionary attacks and its complexity.

A trace logic for local security properties.

An improved constraint-based system for the veriﬁcation of security protocols.

Analysis Models for Security Protocols.

Authentication and authenticated key exchanges.

Automated Veriﬁ-cation of Selected Equivalences for Security Protocols.

Automatic proof of strong secrecy for security protocols.

Constraint differentiation: A new reduction technique for constraint-based analysis of security protocols.

Constraint solver webpage, at http: //www.csl.sri.com/users/millen/capsl/ constraints.html.

Constraint solving for boundedprocess cryptographic protocol analysis.

Deﬁning authentication in a trace model.

Formal speciﬁcation and analysis of the group domain of interpretation protocol using NPATRL and the NRL protocol analyzer.

How to prevent type ﬂaw attacks on security protocols.

On the security of public key protocols.

Online demos. Improved Constraint-based procedure at http://130.89.144.15/cgi-bin/show.cgi. PS-LTL demo at http://130.89.144.15/ cgi-bin/psltl/show.cgi,

Proof theory, transformations, and logic programming for debugging security protocols.

A Logic for Constraint-based Security Protocol Analysis

Abstract

Similar works

Full text

Available Versions

Pure OAI Repository

University of Twente Research Information

Pure OAI Repository

CiteSeerX

NARCIS

NARCIS