Towards probabilistic intrusion detection in supervisory control of discrete event systems

Meira-Góes, Rômulo; Keroglou, Christoforos; Lafortune, Stéphane

doi:10.1016/j.ifacol.2020.12.2321

Cited by 4 publications

(2 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…, S u−1 for G (if they exist) as well as the minimum cost index i min . Each supervisor is computed by the UCC function (lines [14][15][16][17][18][19][20][21][22][23][24], and provides a different control policy such that every string reaching secret states has at least one controllable event of (security) level at v. So in total, S 0 , . .…”

Section: Policy Computation For Uscpmentioning

confidence: 99%

“…Intrusion detection is another problem that has recently attracted much interest (e.g. [19,20,21,22,23]). In this problem, the aim of the system administrator is to detect invasion of intruders by identifying abnormal behaviors in the system; if invasion is detected, an alarm can be set off before any catastrophic damage can be done by intruders.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Usability Aware Secret Protection with Minimum Cost

Matsui

Cai

2021

Preprint

View full text Add to dashboard Cite

In this paper we study a cybersecurity problem of protecting system's secrets with multiple protections and a required security level, while minimizing the associated cost due to implementation/maintenance of these protections as well as the affected system usability. The target system is modeled as a discrete-event system (DES) in which there are a subset of marker states denoting the services/functions provided to regular users, a subset of secret states, and multiple subsets of protectable events with different security levels. We first introduce usability-aware cost levels for the protectable events, and then formulate the security problem as to ensure that every system trajectory that reaches a secret state contains a specified number of protectable events with at least a certain security level, and the highest usability-aware cost level of these events is minimum. We first provide a necessary and sufficient condition under which this security problem is solvable, and when this condition holds we propose an algorithm to solve the problem based on the supervisory control theory of DES. Moreover, we extend the problem to the case of heterogeneous secrets with different levels of importance, and develop an algorithm to solve this extended problem. Finally, we demonstrate the effectiveness of our solutions with a network security example.

show abstract