Paper Info
Title
Mitigating the intractability of the user authorization query problem in role-based access control (RBAC)
Abstract
We address the User Authorization Query problem (UAQ) in Role-Based Access Control (RBAC) which relates to sessions that a user creates to exercise permissions. Prior work has shown that UAQ is intractable (NP -hard). We give a precise formulation of UAQ as a joint optimization problem, and observe that in general, UAQ remains in NP . We then investigate two techniques to mitigate its intractability. (1) We efficiently reduce UAQ to boolean satisfiability in conjunctive normal form, a well-known NP -complete problem for which solvers exist that are efficient for large classes of instances. We point out that a prior attempt is not a reduction, is inefficient, and provides only limited support for joint optimization. (2) We show that UAQ is fixed-parameter polynomial in the upper-bound set of permissions under reasonable assumptions. We discuss an open-source implementation of (1) and (2), based on which we have conducted an empirical assessment.
Year
DOI
Venue
2012
10.1007/978-3-642-34601-9_39
NSS
Keywords
Field
DocType
joint optimization,role-based access control,prior attempt,complete problem,user authorization query problem,empirical assessment,well-known np,prior work,conjunctive normal form,joint optimization problem
Empirical assessment,Polynomial,Computer security,Computer science,Boolean satisfiability problem,Authorization,Role-based access control,Theoretical computer science,Conjunctive normal form,Access control,Optimization problem,Distributed computing
Conference
Citations 
PageRank 
References 
5
0.44
13
Authors
2
Name
Order
Citations
PageRank
Nima Mousavi1161.33
Mahesh V. Tripunitara255833.06