Detecting Conflicts in ABAC Policies with Rule-Reduction and Binary-Search Techniques

ePubs

The open archive for STFC research publications

Persistent URL	http://purl.org/net/epubs/work/50261
Record Status	Checked
Record Id	50261
Title	Detecting Conflicts in ABAC Policies with Rule-Reduction and Binary-Search Techniques
Contributors	C Shu (ICT. Chinese Academic of Sciences ), EY Yang (STFC), AE Arenas (STFC)
Abstract	Attribute-based access control (ABAC) policies are effective and flexible in governing the access to information and resources in open distributed computing environments. However, ABAC policy rules are often complex making them prone to conflicts. This paper proposes an optimized method to detect the conflicts between statistically conflicting rules in an ABAC policy.This method includes two optimization techniques: rule reduction and binary-search. The first technique reduces the rules into a set of compact, semantically equivalent rules through removing redundant information among the rules. The binary-search technique is then applied to discover the conflicts among them.
Organisation	ESC , ESC-IM , STFC
Keywords	Engineering , Attribute-Based Access Control , Access Control , Policy Conflicy Analysis
Funding Information
Related Research Object(s):
Licence Information:
Language	English (EN)

Type	Details	URI(s)	Local file(s)	Year
Paper In Conference Proceedings	IEEE Computer Society. Is in proceedings of: IEEE International Symposium on Policies for Distributed Systems and Networks (Policy 2009), London, UK.		abac_conflicts-4-pages-IEEE.pdf	2009