Browse by author
Lookup NU author(s): Dr Jeremy Bryans, Professor Peter Ryan
Full text for this publication is not currently held within this repository. Alternative links are provided below where available.
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 which to 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.
Author(s): Bryans JW, Koutny M, Ryan PYA
Editor(s): Dimitrakos, T., Martinelli, F.
Publication type: Conference Proceedings (inc. Abstract)
Publication status: Published
Conference Name: Formal Aspects in Security and Trust: IFIP TC1 WG1.7 Workshop on Formal Aspects in Security and Trust (FAST), World Computer Congress
Year of Conference: 2005
Pages: 159-172
Publisher: Springer Verlag
URL: http://dx.doi.org/10.1007/0-387-24098-5_12
DOI: 10.1007/0-387-24098-5_12
Library holdings: Search Newcastle University Library for this item
Series Title: IFIP International Federation for Information Processing,
ISBN: 9780387240503
