Optimal Information Release for Mixed Opacity in Discrete-Event Systems

被引:24
|
作者
Behinaein, Behnam [1 ]
Lin, Feng [2 ,3 ]
Rudie, Karen [1 ]
机构
[1] Queens Univ, Dept Elect & Comp Engn, Kingston, ON K7L 3N6, Canada
[2] Wayne State Univ, Dept Elect & Comp Engn, Detroit, MI 48202 USA
[3] Tongji Univ, Sch Elect & Informat Engn, Shanghai 201804, Peoples R China
基金
加拿大自然科学与工程研究理事会; 美国国家科学基金会; 中国国家自然科学基金;
关键词
Discrete-event systems; Companies; Privacy; Automata; Security; Petri nets; Computer security; discrete-event systems; opacity; secrecy; INDISTINGUISHABLE STATES; AUTOMATA; SECURITY;
D O I
10.1109/TASE.2019.2917136
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Opacity is a property of a system that captures whether certain event sequences (or certain states) are indistinguishable from other event sequences (or states) in the system. Opacity is used in analyzing privacy, secrecy, and other aspects of systems modeled by discrete-event systems. In this paper, we introduce the concept of minimal information release policies for non-opacity and the concept of mixed opacity. Mixed opacity policies are introduced as a holistic approach for solving problems that involve a combination of releasing information to make some objectives of the system opaque while making some other objectives non-opaque. We present a set of algorithms for information release under a mixed opacity policy. These algorithms compute policies in a system such that two given sublanguages are opaque, and at the same time, two other sublanguages in the same system are non-opaque. The application of mixed opacity is demonstrated on the Dining Cryptographers Problem. Note to Practitioners-Many organizations and companies must deal with maintaining privacy and secrecy and the protection of their intellectual property while at the same time revealing information to their employees so that they can properly do their jobs. In addition, to maintain transparency, companies and organizations must also reveal information to the public. In this paper, discrete-event system's modeling is used to produce policies that capture the balance between privacy and transparency.
引用
收藏
页码:1960 / 1970
页数:11
相关论文
共 50 条
  • [31] DIAGNOSABILITY OF DISCRETE-EVENT SYSTEMS
    SAMPATH, M
    SENGUPTA, R
    LAFORTUNE, S
    SINNAMOHIDEEN, K
    TENEKETZIS, D
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1995, 40 (09) : 1555 - 1575
  • [32] ON OBSERVABILITY OF DISCRETE-EVENT SYSTEMS
    LIN, F
    WONHAM, WM
    INFORMATION SCIENCES, 1988, 44 (03) : 173 - 198
  • [33] ON THE CONTROL OF DISCRETE-EVENT SYSTEMS
    WONHAM, WM
    LECTURE NOTES IN CONTROL AND INFORMATION SCIENCES, 1989, 135 : 542 - 557
  • [34] Fault diagnosis in discrete-event systems: Incorporating timing information
    Zad, SH
    Kwong, RH
    Wonham, WM
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2005, 50 (07) : 1010 - 1015
  • [35] ON OPTIMAL ATTRACTION IN DISCRETE-EVENT PROCESSES
    BRAVE, Y
    HEYMANN, M
    INFORMATION SCIENCES, 1993, 67 (03) : 245 - 276
  • [36] On the optimal input allocation of discrete-event systems with dynamic input sequence
    Cahyono, R. T.
    Jayawardhana, B.
    2019 IEEE 58TH CONFERENCE ON DECISION AND CONTROL (CDC), 2019, : 1062 - 1067
  • [37] Reduced Complexity Verification of Almost-Infinite-Step Opacity in Stochastic Discrete-Event Systems
    Liu, Rongjian
    Lu, Jianquan
    Hadjicostis, Christoforos N.
    2022 AMERICAN CONTROL CONFERENCE, ACC, 2022, : 3734 - 3739
  • [38] Opacity of Fuzzy Discrete Event Systems
    Deng, Weilin
    Yang, Jingkai
    Jiang, Cheng
    Qiu, Daowen
    PROCEEDINGS OF THE 2019 31ST CHINESE CONTROL AND DECISION CONFERENCE (CCDC 2019), 2019, : 1840 - 1845
  • [39] Near-optimal online control of dynamic discrete-event systems
    Grigorov, Lenko
    Rudie, Karen
    DISCRETE EVENT DYNAMIC SYSTEMS-THEORY AND APPLICATIONS, 2006, 16 (04): : 419 - 449
  • [40] Near-Optimal Online Control of Dynamic Discrete-Event Systems
    Lenko Grigorov
    Karen Rudie
    Discrete Event Dynamic Systems, 2006, 16 : 419 - 449