Synthesis of Optimal Insertion Functions for Opacity Enforcement

Wu, Yi-Chin; Lafortune, Stéphane

doi:10.1109/tac.2015.2440632

Cited by 37 publications

(21 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Since there is no coordination between the intruders, we follow the procedures in [27] to construct the all insertion structure (AIS) that encodes all the valid system and insertion function moves for each intruder respectively. It is then possible to extract an insertion function from the AIS.…”

Section: Enforcement Of Decentralized Opacity Via Insertion Funcmentioning

confidence: 99%

“…The second is that, if the system G contains loops (for the simplest case, imagine there is a self-loop in some state), it could be the case that the inserted string contains s * for some s ∈ E * o and becomes arbitrarily long (for example, Fig. 7 in [27]). In our paper, we restrict the inserted strings to be * -free, that is, the insertions cannot be arbitrarily long and we replace s * with .…”

Section: Enforcement Of Decentralized Opacity Via Insertion Funcmentioning

confidence: 99%

“…The nondeterminism of an NFM comes from the fact that in general |f N M F (q, e)| ≥ 1, which implies that the same input on the same state may result in non-unique insertions and transit to different states. Our NFM formulation is similar to the insertion automaton [27] but we allow nondeterministic choices of insertions upon observing a system output e ∈ E o . The procedure to convert an AIS into an NFM M = (Q, Σ In , Σ Out , q 0 , f ) is as follows.…”

Section: B Enforcement Scheme Of Joint Opacity In Discrete-event Sysmentioning

confidence: 99%

“…Given N intruders and the system G with |X| states, the space and time complexity to construct each AIS is polynomial with |X E | [27], where |X E | = 2 |X| denotes the total number of states of the state estimator. Each NFM's state space is at most the state pace of its AIS.…”

Section: Complexity Analysismentioning

confidence: 99%

See 3 more Smart Citations

Synthesis of Insertion Functions to Enforce Decentralized and Joint Opacity Properties of Discrete-event Systems

Dai

Lin

2018

2018 Annual American Control Conference (ACC)

View full text Add to dashboard Cite

Opacity is a confidentiality property that characterizes the non-disclosure of specified secret information of a system to an outside observer. In this paper, we consider the enforcement of opacity within the discrete-event system formalism in the presence of multiple intruders. We study two cases, one without coordination among the intruders and the other with coordination. We propose appropriate notions of opacity corresponding to the two cases, respectively, and propose enforcement mechanisms for these opacity properties based on the implementation of insertion functions, which manipulates the output of the system by inserting fictitious observable events whenever necessary. The insertion mechanism is adapted to the decentralized framework to enforce opacity when no coordination exists. Furthermore, we present a coordination and refinement procedure to synthesize appropriate insertion functions to enforce opacity when intruders may coordinate with each other by following an intersection-based coordination protocol. The effectiveness of the proposed opacity-enforcement approaches is validated through illustrative examples.

show abstract

Section: Enforcement Of Decentralized Opacity Via Insertion Funcmentioning

confidence: 99%

Section: Enforcement Of Decentralized Opacity Via Insertion Funcmentioning

confidence: 99%

Section: B Enforcement Scheme Of Joint Opacity In Discrete-event Sysmentioning

confidence: 99%

Section: Complexity Analysismentioning

confidence: 99%

See 2 more Smart Citations

Synthesis of Insertion Functions to Enforce Decentralized and Joint Opacity Properties of Discrete-event Systems

Dai

Lin

2018

2018 Annual American Control Conference (ACC)

View full text Add to dashboard Cite

show abstract

“…Given an SDES H, an MDP M can be constructed to show all the possible insertion functions or strategies in MDP's term [24] with the following assumption to guarantee that the resulting M has a finite state space. In our case, where the model is a PSDES P H = (Q, Σ, P, π 0 , V ), with Assumption 2 and 3, we could follow the same algorithm to obtain a PMDP M = (S,ŝ, A, T, V ).…”

Section: Assumption 2 For a Parametric Psdes P Hmentioning

confidence: 99%

Parameter and Insertion Function Co-synthesis for Opacity Enhancement in Parametric Stochastic Discrete Event Systems

Liu

Lin

2018

2018 Annual American Control Conference (ACC)

View full text Add to dashboard Cite

Opacity is a property that characterizes the system's capability to keep its "secret" from being inferred by an intruder that partially observes the system's behavior. In this paper, we are concerned with enhancing the opacity using insertion functions, while at the same time, enforcing the task specification in a parametric stochastic discrete event system. We first obtain the parametric Markov decision process that encodes all the possible insertions. Based on which, we convert this parameter and insertion function co-synthesis problem into a nonlinear program. We prove that if the output of this program satisfies all the constraints, it will be a valid solution to our problem. Therefore, the security and the capability of enforcing the task specification can be simultaneously guaranteed.

show abstract

Opacity of Discrete Event Systems

Hadjicostis

2020

Encyclopedia of Systems and Control

View full text Add to dashboard Cite

Synthesis of Optimal Insertion Functions for Opacity Enforcement

Cited by 37 publications

References 19 publications

Synthesis of Insertion Functions to Enforce Decentralized and Joint Opacity Properties of Discrete-event Systems

Synthesis of Insertion Functions to Enforce Decentralized and Joint Opacity Properties of Discrete-event Systems

Parameter and Insertion Function Co-synthesis for Opacity Enhancement in Parametric Stochastic Discrete Event Systems

Opacity of Discrete Event Systems

Contact Info

Product

Resources

About