Towards approximate opacity of cyber-physical system

Abstract

Opacity is an important information-flow security property in the analysis of cyber-physical systems. It captures the plausible deniability of the system's secret behavior in the presence of an intruder that may access the information flow. Existing works on opacity only consider non-metric systems by assuming that the intruder can always distinguish two different outputs precisely. In this paper, we extend the concept of opacity to systems whose output sets are equipped with metrics. Such systems are widely used in the modeling of many real-world systems whose measurements are physical signals. A new concept called approximate opacity is proposed in order to quantitatively evaluate the security guarantee level with respect to the measurement precision of the intruder. Then we propose a new simulation-type relation, called approximate opacity preserving simulation relation, which characterizes how close two systems are in terms of the satisfaction of approximate opacity. This allows us to verify approximate opacity for large-scale, or even infinite systems, using their abstractions. We also discuss how to construct approximate opacity preserving symbolic models for a class of discrete-time control systems. Our results extend the definitions and analysis techniques for opacity from non-metric systems to metric systems.

Opacity Enforcing Supervisory Control using Non-deterministic Supervisors

“…The verification of opacity has also been studied for different DES models including Petri nets [23], [33], [39], stochastic DES [8], [19], [43], [48], real-time systems [41] and networked DES [25], [45]. More recently, the notion of opacity has been extended to linear/nonlinear systems with infinite-states and continuous dynamics [1], [32], [49]. Compositional approaches have also been applied for the verification and synthesis of opacity for large-scale systems [27], [29]- [31].…”