Toggle Main Menu Toggle Search

ePrints

Modelling Dynamic Opacity using Petri Nets with Silent Actions

Lookup NU author(s): Dr Jeremy Bryans, Professor Maciej Koutny, Professor Peter Ryan

Downloads


Abstract

In a previous work, we presented a Petri Net based framework in which various confidentiality properties may be expressed in terms of predicates over system state and abstraction mappings from the reachable states and transitions of the underlying Petri Net. Here we extend that work by generalising these mappings by allowing them to be state dependent. This provides a natural framework in whichto model various situations of importance in security, for example key compromise and refresh, downgrading of secrecy labels and conditional anonymity. We also show how global changes in the abstraction mappings can be used to model how some secrecy requirements depend on the status of the observer. We illustrate this by modelling the various flavours of anonymity that arise in the dining cryptographers example. A further development on the earlier work is to provide a more complete treatment of silent actions. We also discuss the expressiveness of the resulting framework and the decidability of the associated verification problems.


Publication metadata

Author(s): Bryans JW, Koutny M, Ryan PYA

Publication type: Report

Publication status: Published

Series Title: School of Computing Science Technical Report Series

Year: 2004

Pages: 15

Print publication date: 01/08/2004

Source Publication Date: August 2004

Report Number: 855

Institution: School of Computing Science, University of Newcastle upon Tyne

Place Published: Newcastle upon Tyne

URL: http://www.cs.ncl.ac.uk/publications/trs/papers/855.pdf


Share