2018
DOI: 10.1007/978-3-319-76354-5_27
|View full text |Cite
|
Sign up to set email alerts
|

Access Domain-Based Approach for Anomaly Detection and Resolution in XACML Policies

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2018
2018
2018
2018

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(3 citation statements)
references
References 7 publications
0
3
0
Order By: Relevance
“…Consider a policy P with 3 rules. Each rule has two attributes att 1 and att 2 , such that Total complexity (phase 1 + phase 2): Since the complexity of phase 1 is greater than the complexity of phase 2, the former is the order of the total complexity : O(n × d 2 (max(d, n)). We assume that attributes are not constant parameters, i.e.…”
Section: Complexity Of Algorithmmentioning
confidence: 99%
See 2 more Smart Citations
“…Consider a policy P with 3 rules. Each rule has two attributes att 1 and att 2 , such that Total complexity (phase 1 + phase 2): Since the complexity of phase 1 is greater than the complexity of phase 2, the former is the order of the total complexity : O(n × d 2 (max(d, n)). We assume that attributes are not constant parameters, i.e.…”
Section: Complexity Of Algorithmmentioning
confidence: 99%
“…To make the suggested method scalable with great policies (i.e., policies with a huge number of rules), we decompose the policy into several clusters of rules, and then the method is applied to each cluster. A preliminary version of this work is given in [2] which presents succinctly a method to detect and resolve anomalies. Compared to [2], our contributions are as follows:…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation