Supervisory Control for Opacity

Dubreil, Jérémy; Darondeau, Philippe; Marchand, Hervé

doi:10.1109/tac.2010.2042008

Cited by 179 publications

(77 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…They provide sufficient conditions to compute an optimal controller preserving all secrets assuming that the controller has complete knowledge of the system and full control on it. In [10,12], the authors consider a control problem under partial observation and provide algorithms to compute the optimal controller ensuring the opacity of one secret against one attacker. Other works on the enforcement of opacity by means of controllers can be found in [25].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Synthesis of opaque systems with static and dynamic masks

Cassez

Dubreil

Marchand

2012

Form Methods Syst Des

136

View full text Add to dashboard Cite

Opacity is a security property formalizing the absence of secret information leakage and we address in this paper the problem of synthesizing opaque systems. A secret predicate S over the runs of a system G is opaque to an external user having partial observability over G, if s/he can never infer from the observation of a run of G that the run belongs to S. We choose to control the observability of events by adding a device, called a mask, between the system G and the users. We first investigate the case of static partial observability where the set of events the user can observe is fixed a priori by a static mask. In this context, we show that checking whether a system is opaque is PSPACE-complete, which implies that computing an optimal static mask ensuring opacity is also a PSPACE-complete problem. Next, we introduce dynamic partial observability where the set of events the user can observe changes over time and is chosen by a dynamic mask. We show how to check that a system is opaque w.r.t. to a dynamic mask and also address the corresponding synthesis problem: given a system G and secret states S, compute the set of dynamic masks under which S is opaque. Our main result is that the set of such masks can be finitely represented and can be computed in EXPTIME and this is a lower bound. Finally we also address the problem of computing an optimal mask.

show abstract

Section: Introductionmentioning

confidence: 99%

“…In [12], ensuring opacity is done by restricting the behaviors to an opaque subset. We investigate here another strategy which does not alter the system.…”

Section: Introductionmentioning

confidence: 99%

Synthesis of opaque systems with static and dynamic masks

Cassez

Dubreil

Marchand

2012

Form Methods Syst Des

136

View full text Add to dashboard Cite

show abstract

“…Meanwhile, in [5], it was shown that there exists a maximally permissive and regular controller K † in all cases where Σ c ⊆ Σ o and Σ a compares with Σ c and Σ o . In [6], more elaborate constructions were presented for computing K † in the case where…”

Section: (B) the Secret Is Now Opaque With Respect To This Lts The mentioning

confidence: 99%

“…Note that [5] and [6] provide effective synthesis algorithms solving the opacity control problem (i.e., they compute the maximally permissive controller K † ), whereas [21] provides closed formulae characterizing the behavior K † /G without explicitly computing K † .…”

Section: (B) the Secret Is Now Opaque With Respect To This Lts The mentioning

confidence: 99%

“…However, until now the literature has dealt exclusively with finite transition systems. Approaches differ by considering either state-based opacity, e.g., initial-state opacity [18,17] or current-state opacity [8], or language-based opacity [1,2,5,6,10,20,21]. With state opacity, the secret predicate bears either upon the initial state, or upon the current state, or upon the set of all states that have been visited from the beginning of a run.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Enforcing Opacity of Regular Predicates on Modal Transition Systems

Darondeau

2012

IFAC Proceedings Volumes

Self Cite

View full text Add to dashboard Cite

Given a labelled transition system G partially observed by an attacker, and a regular predicate Sec over the runs of G, enforcing opacity of the secret Sec in G means computing a supervisory controller K such that an attacker who observes a run of the controlled system K/G cannot ascertain that the trace of this run belongs to Sec based on the knowledge of G and K. We lift the problem from a single labelled transition system G to the class of all labelled transition systems specified by a Modal Transition System M . The lifted problem is to compute the maximally permissive controller K such that Sec is opaque in K/G for every labelled transition system G which is a model of M . The situations of the attacker and of the controller are asymmetric: at run time, the attacker may fully know G and K whereas the controller knows only M and the sequence of actions executed so far by the unknown G. We address the problem in two cases. Let Σ a denote the set of actions that can be observed by the attacker, and let Σ c and Σ o denote the sets of actions that can be controlled and observed by the controller, respectively. We provide optimal and regular controllers that enforce the opacity of regular secrets when Σ c ⊆ Σ o ⊆ Σ a = Σ. We provide optimal and regular controllers that enforce the opacity of regular upper-closed secrets (Sec = Sec.Σ * ) under the following assumptions: (i) Σ a ⊆ Σ c ⊆ Σ o = Σ or (ii) Σ a , Σ c ⊆ Σ o = Σ and wσ ∈ Sec ⇒ w ∈ Sec for all σ ∈ Σ \ Σ c .

show abstract

Estimation and Verification of Partially Observed Discrete‐Event Systems

Yin

2019

Wiley Encyclopedia of Electrical and Electronics Engineering

View full text Add to dashboard Cite

State estimation is one of the most fundamental problems in the systems and control theory. In many real-world systems, it is not always possible to access the full information of the system due to measurement noises/uncertainties and the existence of adversaries. Therefore, how to estimate the state of the system is crucial when one wants to make decisions based on the limited and incomplete information.Given a system, one of the most important questions is to prove/disprove the correctness of the system with respect to some desired requirement (or specification). In particular, we would like to check the correctness of the system in a formal manner in the sense that the checking procedures are algorithmic and results have provable correctness guarantees. Such a formal satisfaction checking problem is referred to as the verification problem. Performing formal property verification is very important for many complicated but safety-critical infrastructures.This article considers state estimation and verification problems for an important class of man-made cyber-physical systems called Discrete-Event Systems (DES). Roughly speaking, DES are dynamic systems with discrete state-spaces and event-triggered dynamics. DES models are widely used in the study of complex automated systems where the behavior is inherently eventdriven, as well as in the study of discrete abstractions of continuous, hybrid, and/or cyber-physical systems. Over the past decades, the theory of DES has been successfully applied to many real-world problems, e.g., the control of

show abstract

Supervisory Control for Opacity

Cited by 179 publications

References 25 publications

Synthesis of opaque systems with static and dynamic masks

Synthesis of opaque systems with static and dynamic masks

Enforcing Opacity of Regular Predicates on Modal Transition Systems

Estimation and Verification of Partially Observed Discrete‐Event Systems

Contact Info

Product

Resources

About