Affiliations: [a] Istituto di Informatica e Telematica, CNR, Pisa, Italy. E-mail: stefano.bistarelli@iit.cnr.it | [b] Dipartimento di Scienze, Universitá degli Studi “G. D'annunzio”, Pescara, Italy. E-mail: bista@sci.unich.it | [c] Department of Computer Science, University College Cork, Ireland. E-mail: s.foley@cs.ucc.ie | [d] Cork Constraint Computation Centre, Department of Computer Science, University College Cork, Ireland. E-mail: b.osullivan@cs.ucc.ie
Abstract: The security of a network configuration is based not just on the security of its individual components and their direct interconnections, but also on the potential for systems to interoperate indirectly across network routes. Such interoperation has been shown to provide the potential for cascading paths that violate security, in a circuitous manner, across a network. In this paper we show how constraint satisfaction provides a natural approach to expressing the necessary constraints to ensure multilevel security across a network configuration. In particular, soft constraints are used to detect and eliminate the cascading network paths that compromise security. Taking this approach results in practical advancements over existing solutions to this problem. In particular, constraint satisfaction highlights the set of all cascading paths, which we can eliminate in polynomial time by breaking a minimal number of system links to ensure security.
