Skip to main navigation Skip to search Skip to main content

Greedy algorithm for least privilege in RBAC model

  • Harbin Institute of Technology Shenzhen

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationCombinatorial Optimization and Applications - 5th International Conference, COCOA 2011, Proceedings
Pages537-545
Number of pages9
DOIs
StatePublished - 2011
Externally publishedYes
Event5th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2011 - Zhangjiajie, China
Duration: 4 Aug 20116 Aug 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6831 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference5th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2011
Country/TerritoryChina
CityZhangjiajie
Period4/08/116/08/11

Keywords

  • Least privilege
  • NP-hard
  • greedy algorithm
  • performance ratio

Fingerprint

Dive into the research topics of 'Greedy algorithm for least privilege in RBAC model'. Together they form a unique fingerprint.

Cite this