Quantifying opacity
From MaRDI portal
Abstract: Opacity is a general language-theoretic framework in which several security properties of a system can be expressed. Its parameters are a predicate, given as a subset of runs of the system, and an observation function, from the set of runs into a set of observables. The predicate describes secret information in the system and, in the possibilistic setting, it is opaque if its membership cannot be inferred from observation. In this paper, we propose several notions of quantitative opacity for probabilistic systems, where the predicate and the observation function are seen as random variables. Our aim is to measure (i) the probability of opacity leakage relative to these random variables and (ii) the level of uncertainty about membership of the predicate inferred from observation. We show how these measures extend possibilistic opacity, we give algorithms to compute them for regular secrets and observations, and we apply these computations on several classical examples. We finally partially investigate the non-deterministic setting.
Recommendations
- Probabilistic opacity for Markov decision processes
- Opacity of discrete event systems and its applications
- Comparing the notions of opacity for discrete-event systems
- A general language-based framework for specifying and verifying notions of opacity
- Infinite-step opacity and K-step opacity of stochastic discrete-event systems
Cites work
- A logic for reasoning about time and reliability
- Anonymity protocols as noisy channels
- Asymptotic information leakage under one-try attacks
- Compositional closure for Bayes risk in probabilistic noninterference
- Computing the leakage of information-hiding systems
- Information flow in interactive systems
- Markov decision processes and regular events
- Model checking of probabilistic and nondeterministic systems
- Opacity of discrete event systems and its applications
- Preserving Secrecy Under Refinement
- Quantifying information leakage in process calculi
- Quantitative information flow, with a view
Cited in
(22)- Infinite-step opacity and K-step opacity of stochastic discrete-event systems
- Opacity for linear constraint Markov chains
- Probabilistic system opacity in discrete event systems
- Enforcement of opacity by public and private insertion functions
- Opacity of networked discrete event systems
- Enhancement of opacity for distributed state estimation in cyber-physical systems
- Information control in networked discrete event systems and its application to battery management systems
- Enforcing opacity of regular predicates on modal transition systems
- A novel approach for supervisor synthesis to enforce opacity of discrete event systems
- A general language-based framework for specifying and verifying notions of opacity
- Simulation opacity
- Process opacity for timed process algebra
- Synthesis of opaque systems with static and dynamic masks
- Probabilistic opacity for Markov decision processes
- Probabilistic disclosure: maximisation vs. minimisation
- Studying opacity of reaction systems through formula based predictors
- Privacy-preserving co-synthesis against sensor-actuator eavesdropping intruder
- Game current-state opacity formulation in probabilistic resource automata
- Online prognosis of stochastic discrete event systems with guaranteed performance bound
- Enforcing opacity by insertion functions under multiple energy constraints
- Quantifying opacity of discrete event systems modeled with probabilistic Petri nets
- Accurate approximate diagnosis of (controllable) stochastic systems
This page was built for publication: Quantifying opacity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5740626)
