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

Dai, Jin; Lin, Hai

doi:10.23919/acc.2018.8431583

Cited by 20 publications

(7 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the case of multiple intruders, Wu et al [34] investigate the problem of enforcing system opacity. There may or may not be coordination between intruders.…”

Section: ) Insertion Functionsmentioning

confidence: 99%

Overview of Opacity in Discrete Event Systems

Jiang

Guo

et al. 2020

IEEE Access

View full text Add to dashboard Cite

In recent years, opacity has received increasing attention in terms of analyzing security and privacy problems. Opacity is a confidentiality property that characterizes a system's ability to hide its secret information from any external intruders. A systematic overview of opacity in the context of discrete event systems (DESs) was conducted; this paper firstly reviews the verification methods and computational complexity of the opacity in DESs using the formalisms of automata and Petri nets. When the system is verified to be non-opaque, the approaches that synthesize an opaque system are summarized. Finally, the future research directions and open problems of opacity in DES are also reviewed.

show abstract

“…In the case of multiple intruders, Wu et al [34] investigate the problem of enforcing system opacity. There may or may not be coordination between intruders.…”

Section: ) Insertion Functionsmentioning

confidence: 99%

Overview of Opacity in Discrete Event Systems

Jiang

Guo

et al. 2020

IEEE Access

View full text Add to dashboard Cite

show abstract

“…There are many other important topics that we are not able to cover here, including (probabilistic) attack on probabilistic systems, game based solving approach, model checking based solving approach, ideas using attack trees and graphs [55]- [58] and so on. In addition, it is possible to investigate cooperative attack scenarios or decentralized attack architectures in similar spirit to [59], [60]. Last but not the least, it is important to consider the potential applications for securing practical industrial control systems.…”

Section: G Other Topicsmentioning

confidence: 99%

Supervisory Control of Discrete-Event Systems under Attacks: An Overview and Outlook

Rashidinejad

Wetzels

Reniers

et al. 2019

2019 18th European Control Conference (ECC)

View full text Add to dashboard Cite

DOI to the publisher's website. • The final author version and the galley proof are versions of the publication after peer review. • The final published version features the final layout of the paper including the volume, issue and page numbers. Link to publication General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal. If the publication is distributed under the terms of Article 25fa of the Dutch Copyright Act, indicated by the "Taverne" license above, please follow below link for the End User Agreement:

show abstract

“…When a system is verified to be non-opaque, one important problem is to enforce opacity via some mechanisms. In general, there are two approaches for enforcing opacity: one is to control the actual behavior of the system so that those secret-revealing behaviors can be avoided [1], [4], [14], [16], [34], [41], [43], [50], [56] the other one is to change the information-flow of the system so that the intruder can be "cheated" or be "confused" [3], [10], [19], [20], [28], [44], [45], [52], [54]. In particular, the first approach is essentially the supervisory control of opacity that aims to find a supervisor that restricts the behavior of the system dynamically such that the closed-loop system is opaque.…”

Section: Introductionmentioning

confidence: 99%

Optimal Synthesis of Opacity-Enforcing Supervisors for Qualitative and Quantitative Specifications

Xie¹,

Yin²,

Li³

2021

Preprint

View full text Add to dashboard Cite

In this paper, we investigate both qualitative and quantitative synthesis of optimal privacy-enforcing supervisors for partially-observed discrete-event systems. We consider a dynamic system whose information-flow is partially available to an intruder, which is modeled as a passive observer. We assume that the system has a "secret" that does not want to be revealed to the intruder. Our goal is to synthesize a supervisor that controls the system in a least-restrictive manner such that the closed-loop system meets the privacy requirement. For the qualitative case, we adopt the notion of infinite-step opacity as the privacy specification by requiring that the intruder can never determine for sure that the system is/was at a secret state for any specific instant. If the qualitative synthesis problem is not solvable or the synthesized solution is too restrictive, then we further investigate the quantitative synthesis problem so that the secret is revealed (if unavoidable) as late as possible. Effective algorithms are provided to solve both the qualitative and quantitative synthesis problems. Specifically, by building suitable information structures that involve information delays, we show that the optimal qualitative synthesis problem can be solved as a safety-game. The optimal quantitative synthesis problem can also be solved as an optimal total-cost control problem over an augmented information structure. Our work provides a complete solution to the standard infinite-step opacity control problem, which has not been solved without assumption on the relationship between controllable events and observable events. Furthermore, we generalize the opacity enforcement problem to the numerical setting by introducing the secret-revelation-time as a new quantitative measure.

show abstract

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

Cited by 20 publications

References 25 publications

Overview of Opacity in Discrete Event Systems

Overview of Opacity in Discrete Event Systems

Supervisory Control of Discrete-Event Systems under Attacks: An Overview and Outlook

Optimal Synthesis of Opacity-Enforcing Supervisors for Qualitative and Quantitative Specifications

Contact Info

Product

Resources

About