Opacity with powerful attackers

被引：11
作者：
Helouet, Loic [1 ]
Marchand, Herve [1 ]
Ricker, Laurie [2 ]
机构：
[1] INRIA Rennes, Rennes, France
[2] Mt Allison Univ, Sackville, NB, Canada
来源：
IFAC PAPERSONLINE | 2018年 / 51卷 / 07期
关键词：
D O I：
10.1016/j.ifacol.2018.06.341
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
This paper considers state-based opacity in a setting where attackers of a secret have additional observation capacities allowing them to know which inputs are allowed by a system. We show that regular opacity is decidable in this setting. We then address the question of controlling a system so that it becomes opaque, and solve this question by recasting the problem in a game setting. (C) 2018, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.
引用
收藏
页码：464 / 471
页数：8
相关论文
共 12 条
  • [1] Concurrent secrets
    Badouel, E.
    Bednarczyk, M.
    Borzyszkowski, A.
    Caillaud, B.
    Darondeau, P.
    [J]. DISCRETE EVENT DYNAMIC SYSTEMS-THEORY AND APPLICATIONS, 2007, 17 (04): : 425 - 446
  • [2] Quantifying opacity
    Berard, Beatrice
    Mullins, John
    Sassolas, Mathieu
    [J]. MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE, 2015, 25 (02) : 361 - 403
  • [3] Bryans JW, 2005, P 3 INT WORKSH FORM, P81
  • [4] Synthesis of opaque systems with static and dynamic masks
    Cassez, Franck
    Dubreil, Jeremy
    Marchand, Herve
    [J]. FORMAL METHODS IN SYSTEM DESIGN, 2012, 40 (01) : 88 - 115
  • [5] Chatterjee K, 2014, LECT NOTES COMPUT SC, V8573, P110
  • [6] The Complexity of Partial-Observation Parity Games
    Chatterjee, Krishnendu
    Doyen, Laurent
    [J]. LOGIC FOR PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND REASONING, 2010, 6397 : 1 - +
  • [7] Goguen J. A., 1982, Proceedings of the 1982 Symposium on Security and Privacy, P11
  • [8] GRADEL E, 1998, LNCS, V2500
  • [9] Peterson G. L., 1979, 20th Annual Symposium of Foundations of Computer Science, P348, DOI 10.1109/SFCS.1979.25
  • [10] Reif J., 1979, STOC
12