Lookup NU author(s): Dr Jeremy Bryans,
Professor Maciej Koutny,
Dr Chunyan Mu
Full text for this publication is not currently held within this repository. Alternative links are provided below where available.
Opacity is a general approach for describing and unifying security properties expressed as predicates. A predicate is opaque if an observer of the system is unable to determine the satisfaction of the predicate in a given run of the system. The meaning of opacity is straightforward when considering the standard (qualitative) operational semantics, but there are a number of possible interpretations in a context where quantitative information about system evolutions is available. We propose four variants of quantitative opacity defined for probabilistic labelled transition systems, with each variant capturing a different aspect of quantifying the opacity of a predicate. Moreover, we present results showing how these four properties can be checked or approximated for specific classes of probabilistic labelled transition systems, observation functions, and system predicates.
Author(s): Bryans JW, Koutny M, Mu C
Editor(s): Catuscia Palamidessi and Mark Dermot Ryan
Publication type: Conference Proceedings (inc. Abstract)
Publication status: Published
Conference Name: Trustworthy Global Computing - 7th International Symposium, TGC 2012
Year of Conference: 2013
ISSN: 9783642411564 (Print)
Library holdings: Search Newcastle University Library for this item
Series Title: Lecture Notes in Computer Science