Measuring Opacity for Non-Probabilistic DES: a SOG-Based Approach

Bourouis, Amina; Klaï, Kaïs; Hadj-Alouane, Nejib Ben

doi:10.1109/iceccs.2019.00034

Cited by 4 publications

(3 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The researchers make the system meet the characteristics of strong opacity,weak opacity and complete transparency by modifying the language set [9] . Not only for classic DES,the more complex opacity properties of probability DES [10][11][12] random DES [13][14][15] have been studied in depth.At the same time,the more complex modular system [16,17] has also been studied.These more complex systems are more suitable for practical industrial production applications.For checking whether the system has opacity properties, the verification method is generally adopted [18][19][20] . At present,there have been in-depth studies on various types of opacity verification algorithms and complexity,such as step opacity [21,22] infinite step opacity [23] , initial state opacity [24] , etc.There are currently two methods to make systems without opacity attribute have opacity attribute.One is the method based on the theory of supervision and control [25][26][27] , and the other is the enforcement method [28,29] .…”

Section: Introductionmentioning

confidence: 99%

A survey of the opacity of discrete event systems

Liang

2023

Sixth International Conference on Advanced Electronic Materials, Computers, and Software Engineering (AEMCSE 2023)

View full text Add to dashboard Cite

In recent years, with the widespread application of information network technology, information security has become increasingly important. More information leaks occur during the exchange of information flows, and opacity is a very important concept in the exchange of system information flows. It refers to the inability of external intruders to observe and infer the nature of key system behaviors through system non secret behaviors. "Opacity" is an inherent attribute of a system. The related research on opacity is widely used in various industrial control fields to meet system security and privacy requirements. This article summarizes and compares various definitions and implementation methods related to the research on opacity in discrete event systems, and analyzes their respective use scenarios and differences based on the characteristics of various types of opacity; The mathematical conditions and complexity of various opacity implementations are summarized, and the complexity of different implementations is compared. The reasons for the different complexity of different implementations are analyzed; Finally, according to the current development direction of opacity research, the future research direction of opacity is prospected.

show abstract

Section: Introductionmentioning

confidence: 99%

A survey of the opacity of discrete event systems

Liang

2023

Sixth International Conference on Advanced Electronic Materials, Computers, and Software Engineering (AEMCSE 2023)

View full text Add to dashboard Cite

show abstract

“…However, a probabilistic model is much more difficult to be abstracted than a non-probabilistic version. The study in [26] is the first work that introduces the quantification of opacity into non-probabilistic DES. Considering that the essence of opacity is to explore the observational equivalent strings, the authors developed a method to calculate the opacity degree of a system by computing the dispersion among non-secret runs and secret equivalents.…”

Section: Introductionmentioning

confidence: 99%

“…We show that current-state opacity is strictly weaker than worthy opacity. The proposed notion of worthy opacity is closely related to the notion of opacity degree in [26]. The contributions of this article can be summarized as follows:…”

Section: Introductionmentioning

confidence: 99%

Security Quantification for Discrete Event Systems Based on the Worth of States

Zhou,

Yu,

Yin

et al. 2023

Mathematics

View full text Add to dashboard Cite

This work addresses the problem of quantifying opacity for discrete event systems. We consider a passive intruder who knows the overall structure of a system but has limited observational capabilities and tries to infer the secret of this system based on the captured information flow. Researchers have developed various approaches to quantify opacity to compensate for the lack of precision of qualitative opacity in describing the degree of security of a system. Most existing works on quantifying opacity study specified probabilistic problems in the framework of probabilistic systems, where the behaviors or states of a system are classified as secret or non-secret. In this work, we quantify opacity by a state-worth function, which associates each state of a system with the worth it carries. To this end, we present a novel category of opacity, called worthy opacity, characterizing whether the worth of information exposed to the outside world during the system’s evolution is below a threshold. We first provide an online approach for verifying worthy opacity using the notion of a run matrix proposed in this research. Then, we investigate a class of systems satisfying the so-called 1-cycle returned property and present a worthy opacity verification algorithm for this class. Finally, an example in the context of smart buildings is provided.

show abstract

A Novel Approach for Supervisor Synthesis to Enforce Opacity of Discrete Event Systems

Souid¹,

Klaï²

2021

Information and Communications Security

View full text Add to dashboard Cite

Measuring Opacity for Non-Probabilistic DES: a SOG-Based Approach

Cited by 4 publications

References 19 publications

A survey of the opacity of discrete event systems

A survey of the opacity of discrete event systems

Security Quantification for Discrete Event Systems Based on the Worth of States

A Novel Approach for Supervisor Synthesis to Enforce Opacity of Discrete Event Systems

Contact Info

Product

Resources

About