A semantics of security protocol language (SPL) using a class of composable high-level Petri nets

Bouroulet, Roland; Klaudel, Hanna; Pelz, Elisabeth

doi:10.1109/csd.2004.1309120

Cited by 4 publications

(15 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this section, we briefly recall the syntax, the intuitive semantics of SPL and some examples of its S-net translation (for the last, see also [BKP04] We use the vector notation x which abbreviates some possibly empty list x 1 , . .…”

Section: Syntax and Intuitive Semantics Of Splmentioning

confidence: 99%

“…Each SPL process may be translated compositionally into a corresponding S-net, as defined in [BKP04], providing its high-level Petri net representation. S-nets, like other high-level Petri net models, carry the usual annotations on places (types, i.e., sets of allowed tokens), arcs (multisets of net variables) and transitions (guards which are Boolean expressions playing the role of occurrence conditions).…”

Section: S-net Semantics Of Splmentioning

confidence: 99%

“…As shown in [BKP04] and more recently in [ADK05], model-checking techniques may easily be used for the presented semantics for proving 'negative' properties (i.e., properties for which the answer is NO). However, for 'positive' properties, the usage of these techniques is limited because of infinite constructions needed for representing the environment.…”

Section: Introductionmentioning

confidence: 99%

“…In next sections, we first recall the Petri net semantics of SPL given in [BKP04], point out and discuss the different reasons which lead to an infinite net and infinite marking graphs, and propose stepwise transformations of the net, which ensure finiteness. As main result, we show that no behaviour is lost or added during these transformations, considering adequate equivalence relations.…”

Section: Introductionmentioning

confidence: 99%

“…In [BKP04], another Petri net semantics has been defined using composable high-level Petri nets, called S-nets. In this approach, each SPL input or output action gives rise to a basic S-net, and the semantics of an SPL term is obtained by composing all these nets together following the structure of the term using S-net composition operations.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Modelling and verification of authentication using enhanced net semantics of SPL (Security Protocol Language)

Bouroulet¹,

Klaudel²,

Pelz³

Sixth International Conference on Application of Concurrency to System Design (ACSD'06)

Self Cite

View full text Add to dashboard Cite

This paper proposes an enhanced translation of SecurityProtocol Language (SPL) in high-level Petri nets in order to allow to prove automatically, using model-checking techniques, the authentication property of Needham-SchroederLowe (NSL) protocol. The proposed approach generates finite nets and goes this way beyond the limitation which was imposed by the previous semantics due to the treatment of the replication operator. In order to reach this goal, we modify the way attacks are modelled. Due to fact that the presented approach focuses on the treatment of the protocol environment, it may be successfully reused for automated verification of properties of other security protocols.

show abstract

Section: Syntax and Intuitive Semantics Of Splmentioning

confidence: 99%

Section: S-net Semantics Of Splmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Modelling and verification of authentication using enhanced net semantics of SPL (Security Protocol Language)

Bouroulet¹,

Klaudel²,

Pelz³

Sixth International Conference on Application of Concurrency to System Design (ACSD'06)

Self Cite

View full text Add to dashboard Cite

show abstract

Modeling and Analysis of Security Protocols Using Role Based Specifications and Petri Nets

Bouroulet

Devillers

Klaudel

et al. 2008

Applications and Theory of Petri Nets

View full text Add to dashboard Cite

In this paper, we introduce a framework composed of a syntax and its compositional Petri net semantics, for the specification and verification of properties (like authentication) of security protocols. The protocol agents (e.g., an initiator, a responder, a server, a trusted third party,. . .) are formalized as roles, each of them having a predefined behavior depending on their global and also local knowledge (including for instance public, private and shared keys), and may interact in a potentially hostile environment. The main characteristics of our framework, is that it makes explicit, structured and formal, the usually implicit information necessary to analyse the protocol, for instance the public and private context of execution. The roles and the environment are expressed using SPL processes and compositionally translated into high-level Petri nets, while the context specifying the global and local knowledge of the participants in the protocol is used to generate the corresponding initial marking (with respect to the studied property). Finally, this representation is used to analyse the protocol properties, applying techniques of simulation and modelchecking on Petri nets. The complete approach is illustrated on the case study of the Kao-Chow authentication protocol.

show abstract

Formal modelling and analysis of XML firewall for service-oriented systems

Xu¹,

Ayachit²,

Reddyreddy³

2008

IJSN

View full text Add to dashboard Cite

Firewalls have been designed as a major component to protect a network or a server from being attacked. However, due to their emphasis on packet filtering rather than verifying user permissions and examining packet contents, conventional firewalls are not suitable for protecting service-oriented systems from unauthorised service invocations. In this paper, we present a formal XML firewall security model for service-oriented systems, which supports user authentication and role-based user authorisation according to policy rules that can be updated dynamically. The formal model consists of two major components, namely the application model and the XML firewall model, which are designed compositionally using coloured Petri nets. We analyse both the application model and the XML firewall model using an existing Petri net tool, and demonstrate how key properties of the formal models can be verified, and how design errors can be detected and corrected at an early design stage.

show abstract

A semantics of security protocol language (SPL) using a class of composable high-level Petri nets

Cited by 4 publications

References 11 publications

Modelling and verification of authentication using enhanced net semantics of SPL (Security Protocol Language)

Modelling and verification of authentication using enhanced net semantics of SPL (Security Protocol Language)

Modeling and Analysis of Security Protocols Using Role Based Specifications and Petri Nets

Formal modelling and analysis of XML firewall for service-oriented systems

Contact Info

Product

Resources

About