Towards quantitative analysis of opacity

J.W. Bryans; M. Koutny; C. Mu

doi:10.1007/978-3-642-41157-1_10

Towards quantitative analysis of opacity

J.W. Bryans
, M. Koutny
, C. Mu

Newcastle University

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

8 Citations (Scopus)

Abstract

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.

Original language	English
Title of host publication	Trustworthy Global Computing
Subtitle of host publication	7th International Symposium, TGC 2012, Newcastle upon Tyne, UK, Revised Selected Papers (Lecture Notes in Computer Science)
Editors	Catuscia Palamidessi, Mark D. Ryan
Place of Publication	Heidelberg
Publisher	Springer
Pages	145-163
Number of pages	19
Volume	8191 LNCS
ISBN (Electronic)	9783642411571
ISBN (Print)	9783642411564
DOIs	https://doi.org/10.1007/978-3-642-41157-1_10
Publication status	Published - 2013
Event	7th International Symposium on Trustworthy Global Computing 2012 - Newcastle-upon-Tyne, United Kingdom Duration: 7 Sept 2012 → 8 Sept 2012 Conference number: 7 https://www.cs.bham.ac.uk/~mdr/research/projects/12-TGC/

Conference

Conference	7th International Symposium on Trustworthy Global Computing 2012
Abbreviated title	TGC 2012
Country/Territory	United Kingdom
City	Newcastle-upon-Tyne
Period	7/09/12 → 8/09/12
Internet address	https://www.cs.bham.ac.uk/~mdr/research/projects/12-TGC/

Keywords

Probabilistic opacity
Probabilistic labelled transition systems
Observations

Access to Document

10.1007/978-3-642-41157-1_10

Cite this

Towards quantitative analysis of opacity. / Bryans, J.W.; Koutny, M.; Mu, C.
Trustworthy Global Computing: 7th International Symposium, TGC 2012, Newcastle upon Tyne, UK, Revised Selected Papers (Lecture Notes in Computer Science). ed. / Catuscia Palamidessi; Mark D. Ryan. Vol. 8191 LNCS Heidelberg: Springer, 2013. p. 145-163.

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

Bryans, JW, Koutny, M & Mu, C 2013, Towards quantitative analysis of opacity. in C Palamidessi & MD Ryan (eds), Trustworthy Global Computing: 7th International Symposium, TGC 2012, Newcastle upon Tyne, UK, Revised Selected Papers (Lecture Notes in Computer Science). vol. 8191 LNCS, Springer, Heidelberg, pp. 145-163, 7th International Symposium on Trustworthy Global Computing 2012, Newcastle-upon-Tyne, United Kingdom, 7/09/12. https://doi.org/10.1007/978-3-642-41157-1_10

@inbook{119beb10298544e48e5aa72bcb168893,

title = "Towards quantitative analysis of opacity",

abstract = "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.",

keywords = "Probabilistic opacity, Probabilistic labelled transition systems , Observations ",

author = "J.W. Bryans and M. Koutny and C. Mu",

year = "2013",

doi = "10.1007/978-3-642-41157-1\_10",

language = "English",

isbn = "9783642411564",

volume = "8191 LNCS",

pages = "145--163",

editor = "Catuscia Palamidessi and Ryan, \{Mark D.\}",

booktitle = "Trustworthy Global Computing",

publisher = "Springer",

address = "United Kingdom",

note = "7th International Symposium on Trustworthy Global Computing 2012, TGC 2012 ; Conference date: 07-09-2012 Through 08-09-2012",

url = "https://www.cs.bham.ac.uk/\textasciitilde{}mdr/research/projects/12-TGC/",

}

TY - CHAP

T1 - Towards quantitative analysis of opacity

AU - Bryans, J.W.

AU - Koutny, M.

AU - Mu, C.

N1 - Conference code: 7

PY - 2013

Y1 - 2013

N2 - 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.

AB - 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.

KW - Probabilistic opacity

KW - Probabilistic labelled transition systems

KW - Observations

U2 - 10.1007/978-3-642-41157-1_10

DO - 10.1007/978-3-642-41157-1_10

M3 - Chapter

SN - 9783642411564

VL - 8191 LNCS

SP - 145

EP - 163

BT - Trustworthy Global Computing

A2 - Palamidessi, Catuscia

A2 - Ryan, Mark D.

PB - Springer

CY - Heidelberg

T2 - 7th International Symposium on Trustworthy Global Computing 2012

Y2 - 7 September 2012 through 8 September 2012

ER -

Towards quantitative analysis of opacity

Abstract

Conference

Keywords

Access to Document

Fingerprint

Cite this