Synthesis of opaque systems with static and dynamic masks

Formal Methods in System Design

Volumn 40, Issue 1, 2012, Pages 88-115

  Cassez, Franck ^a   Dubreil, Jérémy ^b   Marchand, Hervé ^c  

^a CNRS   (France)

^b ECOLE POLYTECHNIQUE   (France)

^c INRIA   (France)

Author keywords

Confidentiality property; Dynamic observation; Opacity; Security; Synthesis

Indexed keywords

CONFIDENTIALITY PROPERTY; DYNAMIC MASKS; DYNAMIC OBSERVATION; LOWER BOUNDS; PARTIAL OBSERVABILITY; SECRET INFORMATION; SECURITY; SECURITY PROPERTIES; STATIC AND DYNAMIC; SYNTHESIS PROBLEMS;

OPACITY; OPTIMIZATION; SYNTHESIS (CHEMICAL);

OBSERVABILITY;

EID: 84857190463     PISSN: 09259856     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10703-012-0141-9     Document Type: Article

References (27)

1. Alur R, Černý P, Zdancewic S (2006) Preserving secrecy under refinement. In: ICALP'06: proceedings (Part II) of the 33rd international colloquium on automata, languages and programming. Springer, Berlin, pp 107-118 (Pubitemid 44113241)
2. Badouel E, Bednarczyk M, Borzyszkowski A, Caillaud B, Darondeau P (2007) Concurrent secrets. Discret Event Dyn Syst 17:425-446 (Pubitemid 350074185)
3. Blanchet B, Abadi M, Fournet C (2005) Automated verification of selected equivalences for security protocols. In: 20th IEEE symposium on logic in computer science (LICS 2005), Chicago, IL, June 2005. IEEE Computer Society, Los Alamitos, pp 331-340 (Pubitemid 41462579)
4. Bryans J, Koutny M, Mazaré L, Ryan P (2008) Opacity generalised to transition systems. Int J Inf Secur 7(6):421-435
5. Cassez F, Tripakis S (2008) Fault diagnosis with static or dynamic diagnosers. Fundam Inform 88(4):497-540
6. Cassez F, Mullins J, Roux OH (2007) Synthesis of non-interferent systems. In: 4th int conf on mathematical methods, models and architectures for computer network security (MMM-ACNS'07). Communications in computer and inform science, vol 1. Springer, Berlin, pp 307-321
7. Cassez F, Dubreil J, Marchand H (2009) Dynamic observers for the synthesis of opaque systems. In: Liu Z, Ravn AP (eds) 7th international symposium on automated technology for verification and analysis (ATVA'09), Macao SAR, China, October 2009. LNCS, vol 5799. Springer, Berlin, pp 352-367
8. Darmaillacq V, Fernandez J-C, Groz R, Mounier L, Richier J-L (2006) Test generation for network security rules. In: TestCom 2006. LNCS, vol 3964
9. Dasdan A, Irani S, Gupta R (1999) Efficient algorithms for optimum cycle mean and optimum cost to time ratio problems. In: Annual ACM IEEE design automation conference, New Orleans, Louisiana, United States. ACM, New York, pp 37-42
10. Dubreil J, Darondeau P, Marchand H (2008) Opacity enforcing control synthesis. In: Proceedings of the 9th international workshop on discrete event systems (WODES'08), Göteborg, Sweden, May 2008, pp 28-35
11. Dubreil J, Jéron T, Marchand H (2009) Monitoring confidentiality by diagnosis techniques. In: European control conference, Budapest, Hungary, August 2009, pp 2584-2590
12. Dubreil J, Darondeau Ph, Marchand H (2010) Supervisory control for opacity. IEEE Trans Autom Control 55(5):1089-1100
13. Falcone Y, Fernandez J-C, Mounier L (2011) What can you verify and enforce at runtime? Int J Softw Tools Technol Transf (STTT)
14. Focardi R, Gorrieri R (2001) Classification of security properties (part I: Information flow). In: Focardi R, Gorrieri R (eds) Foundations of security analysis and design I: FOSAD 2000 tutorial lectures. Lecture notes in computer science, vol 2171. Springer, Heidelberg, pp 331-396 (Pubitemid 33364383)
15. Hadj-Alouane N, Lafrance S, Lin F, Mullins J, Yeddes M (2005) On the verification of intransitive noninterference in multilevel security. IEEE Trans Syst Man Cybern, Part B, Cybern 35(5):948-957
16. Karp R (1978) A characterization of the minimum mean cycle in a digraph. Discrete Math 23:309-311
17. Le Guernic G (2007) Information flow testing - the third path towards confidentiality guarantee. In: Advances in computer science, ASIAN 2007, Computer and network security. LNCS, vol 4846, pp 33-47
18. Ligatti J, Bauer L, Walker D (2005) Edit automata: enforcement mechanisms for run-time security policies. Int J Inf Secur 4(1-2):2-16 (Pubitemid 40347198)
19. Lowe G (1999) Towards a completeness result for model checking of security protocols. J Comput Secur 7(2-3):89-146 (Pubitemid 30524009)
20. Martin D (1975) Borel determinacy. Ann Math 102(2):363-371
21. Mazaré L (2004) Using unification for opacity properties. In: Proceedings of the 4th IFIP WG1.7 workshop on issues in the theory of security (WITS'04), Barcelona (Spain), pp 165-176
22. Ricker SL (2006) A question of access: decentralized control and communication strategies for security policies. In: 8th international workshop on discrete event systems, June 2006, pp 58-63 (Pubitemid 46949241)
23. Schneider F (2000) Enforceable security policies. ACM Trans Inf Syst Secur 3(1):30-50
24. Stockmeyer L, Meyer A (1973) Word problems requiring exponential time: Preliminary report. In: STOC. ACM, New York, pp 1-9
25. Takai S, Oka Y (2008) A formula for the supremal controllable and opaque sublanguage arising in supervisory control. J Control Meas Syst Integr 1(4):307-312
26. Thomas W (1995) On the synthesis of strategies in infinite games. In: Proc 12th annual symposium on theoretical aspects of computer science (STACS'95), vol 900. Springer, Berlin, pp 1-13. Invited talk
27. Zwick U, Paterson M (1996) The complexity of mean payoff games on graphs. Theor Comput Sci 158(1-2):343-359 (Pubitemid 126411935)