Handling inheritance violation for secure interoperation of heterogeneous systems
by Hejiao Huang, Helene Kirchner, Songyun Liu, Weili Wu
International Journal of Security and Networks (IJSN), Vol. 4, No. 4, 2009

Abstract: In multiple heterogeneous systems, one of key challenges of integrating policies is the conflict detection and resolution while preserving individual policy consistency. In this paper, the inheritance hierarchy of a security policy is formulated with a directed graph. Solving Inheritance Violation Problem (IVP) is formulated as a feedback arc set problem, which is NP-hard. Then some classical approximation algorithms are introduced. The IVP in two interoperating domains is converted into the problem of finding a minimum weight vertex cover problem in a bipartite graph, which is polynomial-time solvable.

Online publication date: Tue, 22-Sep-2009

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Security and Networks (IJSN):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com