K-Protection of Global Secret in Discrete Event Systems Using Supervisor Control.

2023 IEEE International Conference on Systems, Man, and Cybernetics (SMC)(2023)

引用 0|浏览1
暂无评分
摘要
This work addresses the security problem of protecting secrets in the framework of discrete event systems that are modeled by deterministic finite automata. We characterize a global secret that composes of one or multiple states, in which each state is assigned to a security level. A state is said to be protected if any event sequence from the initial state for reaching it contains the amount of protected events equal to or greater than the required security level. In addition, we assume that the protected event labels must be recovered within a bounded of consecutive protected events (called as $K$ -protection). Our objective is to design a $K$ -protection event policy such that the protected secret state pieces satisfy a predefined protection threshold. To this end, we first construct a security automaton that integrates the system state information and its current security level, and a $K$ -protection automaton that lists all the possible protections of event sequences. Then by using the supervisor control theory technique, the valid protecting policy to enforce the security requirement is obtained. Finally, examples are used to illustrate the proposed protection method.
更多
查看译文
关键词
Discrete Event Systems,System State,Security Level,Discrete System,Security Requirements,Effects Of Labels,Consecutive Events,Secretor Status,Protective Threshold,Personal Information,Problem Statement,Protection Policies,String Length,Supervisory Control,Maximum Protection,Subset Of States,Security Checks,Regular Language,Uncontrollable Events
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要