A general language-based framework for specifying and verifying notions of opacity

  title={A general language-based framework for specifying and verifying notions of opacity},
  author={Andrew Wintenberg and Matthew Blischke and St{\'e}phane Lafortune and Necmiye Ozay},
  journal={Discrete Event Dynamic Systems},
Opacity is an information flow property that captures the notion of plausible deniability in dynamic systems, that is whether an intruder can deduce that “secret” behavior has occurred. In this paper we provide a general framework of opacity to unify the many existing notions of opacity that exist for discrete event systems. We use this framework to discuss language-based and state-based notions of opacity over automata. We present several methods for language-based opacity verification, and a… 
K-Step Opacity in Discrete Event Systems: Verification, Complexity, and Relations
A new algorithm deciding K-step opacity is designed the complexity of which is lower than that of existing algorithms and that does not depend on K, and new transformations among the notions that do not use states that are neither secret nor non-secret (neutral states) are provided.
Verifying Weak and Strong k-Step Opacity in Discrete-Event Systems
A new algorithm is designed that is lower than the complexity of existing algorithms and does not depend on the parameter k, and it is shown how to use it to verify strong k-step opacity by reducing strong k - step opacity to weak k -step opacity.
A Unified Framework for Verification of Observational Properties for Partially-Observed Discrete-Event Systems
A unified framework for verifying observational prop- erties that are related to the information-flow of the system by reducing each of them as an instance of HyperLTL model checking .
You Don't Know What I Know: On Notion of High-Order Opacity in Discrete-Event Systems
This paper says a system is high-order opaque if the intruder can never determine that the system user knows some information of importance based on its own incomparable information.
Sensor Deception Attacks Against Initial-State Privacy in Supervisory Control Systems
This work investigates the problem of synthesiz- ing sensor deception attackers against privacy in the context of supervisory control of discrete-event systems (DES) by presenting an effective approach for synthesizing sensor attack strategies threatening the privacy of the system.


Comparative analysis of related notions of opacity in centralized and coordinated architectures
Initial-and-final-state opacity is a new opacity property introduced in this paper, motivated by secrecy considerations in anonymous network communications; the other three opacity properties have been studied in prior work.
A new approach for the verification of infinite-step and K-step opacity using two-way observers
Verification of Infinite-Step Opacity and Analysis of its Complexity*
It is shown that infinite-step opacity can be verified via the construction of a set of appropriate state estimators, and established that the verification of infinite- step opacity is a PSPACE-hard problem.
Synthesis of insertion functions for enforcement of opacity security properties
Notions of security and opacity in discrete event systems
It is shown that the state-based definition of opacity enables the use of observer constructions for verification purposes and the verification of (S,P, K)-opacity is accomplished via an observer with K-delay which is constructed to capture state estimates withK-delay.
Opacity generalised to transition systems
The notion of opacity is extended to the model of labelled transition systems and generalised in order to better represent concepts from the literature on information flow, and links between opacity and the information flow concepts of anonymity and non-inference are established.
Verification of $K$-Step Opacity and Analysis of Its Complexity
This work provides two methods for verifying K -step opacity using two different state estimator constructions, and analyzes the computational complexity of both.
Infinite-step opacity of stochastic discrete-event systems
A new notion of opacity is proposed to capture whether or not the probability of violating infinite-step opacity is smaller than a given threshold, and an effective algorithm is provided for the verification of almost infinite- step opacity.
On Approximate Opacity of Cyber-Physical Systems
A new simulation-type relation is proposed, called approximate opacity-preserving simulation relation, which characterizes how close two systems are in terms of the satisfaction of approximate opacity, which allows us to verify approximate opacity for large-scale, or even infinite, systems using their abstractions.
Opacity of discrete event systems and its applications
  • F. Lin
  • Computer Science
  • 2011