Note on Opacity with powerful attackers

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.

[1]  John H. Reif,et al.  Multiple-person alternation , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[2]  John H. Reif,et al.  Universal games of incomplete information , 1979, STOC.

[3]  J. Meseguer,et al.  Security Policies and Security Models , 1982, 1982 IEEE Symposium on Security and Privacy.

[4]  Thomas Wilke,et al.  Automata Logics, and Infinite Games , 2002, Lecture Notes in Computer Science.

[5]  Maciej Koutny,et al.  Opacity Generalised to Transition Systems , 2005, Formal Aspects in Security and Trust.

[6]  Benoît Caillaud,et al.  Concurrent Secrets , 2007, 2006 8th International Workshop on Discrete Event Systems.

[7]  Krishnendu Chatterjee,et al.  The Complexity of Partial-Observation Parity Games , 2010, LPAR.

[8]  Mathieu Sassolas,et al.  Quantifying Opacity , 2010, 2010 Seventh International Conference on the Quantitative Evaluation of Systems.

[9]  Hervé Marchand,et al.  Synthesis of opaque systems with static and dynamic masks , 2012, Formal Methods Syst. Des..

[10]  Krishnendu Chatterjee,et al.  Games with a Weak Adversary , 2014, ICALP.

[11]  Nathalie Bertrand,et al.  Active Diagnosis for Probabilistic Systems , 2014, FoSSaCS.

[12]  Serge Haddad,et al.  Optimal constructions for active diagnosis , 2013, J. Comput. Syst. Sci..