![]() |
![]() |
University of Birmingham > Talks@bham > Computer Security Seminars > Quantitative analysis of opacity
Quantitative analysis of opacityAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Vincent Cheval. 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. This talk is part of the Computer Security Seminars series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsType the title of a new list here SERENE Group Seminar Series Facts and SnacksOther talksThe tragic destiny of Mileva Marić Einstein TBC Quantum Sensing in Space TBA Counting cycles in planar graphs Waveform modelling and the importance of multipole asymmetry in Gravitational Wave astronomy |