E. Badouel, M. A. Bednarczyk, A. M. Borzyszkowski, B. Caillaud, and P. Darondeau, Concurrent secrets. Discrete Event Dynamic Systems, vol.17, pp.425-446, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00070249

B. Bérard, J. Mullins, and M. Sassolas, Quantifying opacity, Mathematical Structures in Computer Science, vol.25, issue.2, pp.361-403, 2015.

J. Bryans, M. Koutny, L. Mazaré, R. , and P. Y. , Opacity generalised to transition systems, In Formal Aspects in Security and Trust, pp.81-95, 2005.

F. Cassez, J. Dubreil, and H. Marchand, Synthesis of opaque systems with static and dynamic masks, Formal Methods in System Design, vol.40, issue.1, pp.88-115, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00662539

K. Chatterjee and L. Doyen, The complexity of partial-observation parity games, Proc. of LPAR'17, vol.6397, pp.1-14, 2010.

K. Chatterjee and L. Doyen, Games with a weak adversary, Proc. of ICALP 2014, Part II, vol.8573, pp.110-121, 2014.

J. Goguen and J. Meseguer, Security policies and security models, Proc of IEEE Symposium on Security and Privacy, pp.11-20, 1982.

E. Grädel and W. Thomas, Automata Logics, and Infinite Games : A Guide to Current Research, LNCS, vol.2500, 1998.

G. L. Peterson and J. H. Reif, Multiple-person alternation, FOCS'79, pp.348-363, 1979.

J. Reif, Universal games of incomplete information, STOC, 1979.

M. Sampath, R. Sengupta, S. Lafortune, K. Sinaamohideen, and D. Teneketzis, Diagnosability of discrete event systems, IEEE Transactions on Automatic Control, vol.40, issue.9, pp.1555-1575, 1995.

Y. Wu, S. Lafortune, and S. , Synthesis of insertion functions for enforcement of opacity security properties, Automatica, vol.50, issue.5, pp.1336-1348, 2014.