Depth-first Search Approach for Language-based Opacity Verification Using Petri Nets

Saadaoui, Ikram; Li, Z.; Wu, Naiqin; Khalgui, Mohamed

doi:10.1016/j.ifacol.2021.04.037

Cited by 3 publications

(3 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As far as we know, the only research that addresses the verification of language-based opacity that does not make the assumption of the unobservable subnet being acyclic is our earlier study, which we introduced in [18], where a verification algorithm employing a depth-first search approach verifies the presence of a non-secret transition sequence that is consistent with a secret observation sequence.…”

Section: Mathematical Characterization Of Lbomentioning

confidence: 99%

Language-Based Opacity Verification in Partially Observed Petri Nets through Linear Constraints

Saadaoui,

Labed,

et al. 2023

Mathematics

View full text Add to dashboard Cite

Information security is an important area of concern in modern computer-integrated systems. It involves implementing preventative measures to protect confidential data from potential vulnerabilities, such as unauthorized access, secret disclosure, modification, or destruction. Considering such threats, we investigate a particular confidentiality property called opacity, which specifies a system’s ability to cover its ‘secret’ data from being interfered with by outside observers, termed as intruders. This paper discusses language-based opacity formulation and verification in the context of discrete event systems represented by partially observed Petri nets. In this context, we identify two opacity properties, called consistency and non-secrecy; then, we exploit the mathematical characterization of a net system, to separately check each property, by specifying two feasibility problems. The proposed method is carried out for two distinct settings of a system. The first setting is centralized, where an intruder is granted complete information about the system structure but a partial observation of its behavior. The second setting is decentralized, where a group of intruders cooperates to reveal the secret language, by using a coordinator. Finally, experimental findings are given, to demonstrate the proficiency of the proposed approach.

show abstract

Section: Mathematical Characterization Of Lbomentioning

confidence: 99%

Language-Based Opacity Verification in Partially Observed Petri Nets through Linear Constraints

Saadaoui,

Labed,

et al. 2023

Mathematics

View full text Add to dashboard Cite

show abstract

“…In DESs, the secret can be represented by the states or language of a system. Accordingly, opacity properties are generally classified into two types: state-based opacity (SBO) [9][10][11] and language-based opacity (LBO) 12,13 .The computer security community has recently looked into several aspects of opacity. A brief overview of some of the recent studies is provided in what follows.…”

mentioning

confidence: 99%

mentioning

confidence: 99%

Current-state opacity verification in discrete event systems using an observer net

Labed

Saadaoui

et al. 2022

Sci Rep

View full text Add to dashboard Cite

Due to the proliferation of contemporary computer-integrated systems and communication networks, there is more concern than ever regarding privacy, given the potential for sensitive data exploitation. A recent cyber-security research trend is to focus on security principles and develop the foundations for designing safety-critical systems. In this work, we investigated the problem of verifying current-state opacity in discrete event systems using labeled Petri nets. A system is current-state opaque provided that the current-state estimate cannot be revealed as a subset of secret states. We introduced a new sub-model of the system, named an observer net. The observer net have the same structure as the plant, but it is distinguished by the use of colored markers as well as simultaneous and recursive transition enabling and firing, which offer an efficient state estimation. We considered two settings of the proposed approach: an on-line setting, in which a current-state opacity algorithm is proposed. The algorithm waits for the occurrence of an observable event and determines if the current observation of a plant reveals the secret behaviour, as well as, an off-line setting, where the verification problem is solved based on a state estimator called a colored estimator. In this context, necessary and sufficient conditions for verifying opacity are developed with illustrative examples to demonstrate the presented approach.

show abstract

A classification of cybersecurity strategies in the context of Discrete Event Systems

Oliveira,

Leal,

Teixeira

et al. 2023

Annual Reviews in Control

View full text Add to dashboard Cite

Depth-first Search Approach for Language-based Opacity Verification Using Petri Nets

Cited by 3 publications

References 18 publications

Language-Based Opacity Verification in Partially Observed Petri Nets through Linear Constraints

Language-Based Opacity Verification in Partially Observed Petri Nets through Linear Constraints

Current-state opacity verification in discrete event systems using an observer net

A classification of cybersecurity strategies in the context of Discrete Event Systems

Contact Info

Product

Resources

About