Greedy algorithm for least privilege in RBAC model

Authors:
Jinling Liu;Hejiao Huang;Hongwei Du
Affiliations:
Harbin Institute of Technology Shenzhen Graduate School, China;Harbin Institute of Technology Shenzhen Graduate School, China;Harbin Institute of Technology Shenzhen Graduate School, China
Venue:
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Year:
2011

Citing 10
Cited 0

Proposed NIST standard for role-based access control

ACM Transactions on Information and System Security (TISSEC)
Framework for role-based delegation models

ACSAC '00 Proceedings of the 16th Annual Computer Security Applications Conference
A fine-grained, controllable, user-to-user delegation method in RBAC

Proceedings of the tenth ACM symposium on Access control models and technologies
Role mining with ORCA

Proceedings of the tenth ACM symposium on Access control models and technologies
RoleMiner: mining roles using subset enumeration

Proceedings of the 13th ACM conference on Computer and communications security
Inter-domain role mapping and least privilege

Proceedings of the 12th ACM symposium on Access control models and technologies
Least-Privilege-Based Access Control Model for Job Execution in Grid

ISDPE '07 Proceedings of the The First International Symposium on Data, Privacy, and E-Commerce
Quantitative enforcement of the principle of least privilege in rbac and an efficient fault tolerant cryptosystem

Quantitative enforcement of the principle of least privilege in rbac and an efficient fault tolerant cryptosystem
A Boundary-Based Access Control Model for Sensitive Information

IFITA '09 Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 03
Greedy approximations for minimum submodular cover with submodular cost

Computational Optimization and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Least privilege means only the necessary privileges are needed to complete a task for users. This is one of the most important principles in RBAC model. Currently, how to assign roles to users to achieve this principle is still not solved. In this paper, the least privilege problem is proved to be NP-hard, and an approximation algorithm is given. The simulation result shows that with the algorithm, each user can acquire its privilege to perform its job with the least privilege principle.