Flexible Resolution of Authorisation Conflicts in Distributed Systems

  • Authors:
  • Changyu Dong;Giovanni Russello;Naranker Dulay

  • Affiliations:
  • Department of Computing, Imperial College London, London, UK SW7 2AZ;Department of Computing, Imperial College London, London, UK SW7 2AZ;Department of Computing, Imperial College London, London, UK SW7 2AZ

  • Venue:
  • DSOM '08 Proceedings of the 19th IFIP/IEEE international workshop on Distributed Systems: Operations and Management: Managing Large-Scale Service Deployment
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Managing security in distributed systems requires flexible and expressive authorisation models with support for conflict resolution. Models need to be hierarchical but also non-monotonic supporting both positive and negative authorisations. In this paper, we present an approach to resolve the authorisation conflicts that inevitably occur in such models, with administrator specified conflict resolution strategies (rules). Strategies can be global or applied to specific parts of a system and dynamically loaded for different applications. We use Courteous Logic Programs (CLP) for the specification and enforcement of strategies. Authorisation policies are translated into labelled rules in CLP and prioritised. The prioritisation is regulated by simple override rules specified or selected by administrators. We demonstrate the capabilities of the approach by expressing the conflict resolution strategy for a moderately complex authorisation model that organises subjects and objects hierarchically.