2010 Sixth International Conference on Information Assurance and Security 2010
DOI: 10.1109/isias.2010.5604062
|View full text |Cite
|
Sign up to set email alerts
|

Inconsistency detection method for access control policies

Abstract: In enterprise environments, the task of assigning access control rights to subjects for resources is not trivial. Because of their complexity, distribution and size, access control policies can contain anomalies such as inconsistencies, which can result in security vulnerabilities. A set of access control policies is inconsistent when, for specific situations different incompatible policies can apply. Many researchers have tried to address the problem of inconsistency using methods based on formal logic. Howev… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
10
0

Year Published

2011
2011
2022
2022

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 14 publications
(11 citation statements)
references
References 13 publications
(19 reference statements)
0
10
0
Order By: Relevance
“…Several works [29,1,22,12,11,8,20] have proposed techniques to detect inconsistencies and redundancies in XACML or extensions of RBAC policies by leveraging a variety of verification engines. None of these works provides decidability and complexity results of the analysis techniques as we do in this paper.…”
Section: Related Work and Discussionmentioning
confidence: 99%
“…Several works [29,1,22,12,11,8,20] have proposed techniques to detect inconsistencies and redundancies in XACML or extensions of RBAC policies by leveraging a variety of verification engines. None of these works provides decidability and complexity results of the analysis techniques as we do in this paper.…”
Section: Related Work and Discussionmentioning
confidence: 99%
“…The complexity of access control policy revision is dependent on a number of factors, such as the number of users, number of roles, and number of resources. Due to these factors, one important aspect is to guarantee policy completeness [57] and consistency [58].…”
Section: T) ∧ P Er-t R-a(tr Evaluator = {(Read Obj B ) (Write Obj mentioning
confidence: 99%
“…Trees Decision trees [12] are well-known for expressing access control logic [14] [16]. They are in fact the most efficient representation from the point of view of request processing by a PDP, since a subtree will be explored only if its parent edge satisfies the request.…”
Section: Expressing Access Control Requirements As Decisionmentioning
confidence: 99%
“…Currently the policy compression algorithm from [9] cannot handle such cases. Solutions to include absent attributes are proposed in [16] where they are called missing attributes. However, the use of such an approach is for further study.…”
Section: B Handling Absent Attributesmentioning
confidence: 99%