کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
428921 686968 2014 6 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
On the complexity of role updating feasibility problem in RBAC
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
On the complexity of role updating feasibility problem in RBAC
چکیده انگلیسی


• We define RUFP to determine whether there exists a valid RP assignment.
• Several subcases of RUFP are solvable in linear time.
• RUFP is intractable (NP-complete) in the general case.

In Role Based Access Control (RBAC) systems, it is necessary and important to update the role–permission assignments in order to reflect the evolutions of the system transactions. However, role updating is generally complex and challenging, especially for large-scale RBAC systems. This is because the resulting state is usually expected to meet various requirements and constraints. In this paper, we focus on a fundamental problem of role updating in RBAC, which determines whether there exists a valid role–permission assignment, i.e., whether it can satisfy all the requirements of the role updating and without violating any role–capacity or permission–capacity constraint. We formally define such a problem as the Role Updating Feasibility Problem (RUFP), and study the computational complexity of RUFP in different subcases. Our results show that although several subcases are solvable in linear time, this problem is NP-complete in the general case.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Information Processing Letters - Volume 114, Issue 11, November 2014, Pages 597–602
نویسندگان
, , , , ,