Paper Title:
The Formalization of Least Privilege Mining in RBAC
  Abstract

Devising a complete and correct set of roles for supporting the least privilege principle has been recognized as one of the most important tasks in implementing RBAC. A key problem is how to find such sets of roles which have the least permissions. However there are too few formalized descriptions and definitions on this problem. In order to provide a material object for researching the least privilege principle, we define the least privilege mining problem (LPMP) and its two variations: δ-approx LPMP and MinNoise LPMP. By showing formalized descriptions, we clarify clearly the methods of discovering least permissions. Correspondingly, we give two simple algorithms to implement the methods.

  Info
Periodical
Key Engineering Materials (Volumes 480-481)
Edited by
Yanwen Wu
Pages
1023-1027
DOI
10.4028/www.scientific.net/KEM.480-481.1023
Citation
L. J. Dong, X. J. Kang, J. Song, M. C. Wang, "The Formalization of Least Privilege Mining in RBAC", Key Engineering Materials, Vols. 480-481, pp. 1023-1027, 2011
Online since
June 2011
Export
Price
$32.00
Share

In order to see related information, you need to Login.

In order to see related information, you need to Login.

Authors: Li Jun Dong, Mao Cai Wang, Xiao Jun Kang
Chapter 8: System Modeling and Simulation
Abstract:Role-based access control (RBAC) has been adopted widely by reducing the complexity of the management of access control. The least privilege...
4508
Authors: Wei Zhang, Zuo Quan Lin
Chapter 5: Data Processing, Computer and Information Technologies
Abstract:Although the ANSI RBAC model has achieved great success in the enterprise, it provides no mechanism for the urgent interoperation needs...
1843
Authors: Bo Chen, Jia Di Qiu, Ming Ming Chen
Chapter 5: Algorithms, Computation and Information Technologies
Abstract:The need to securely share information among collaborating entities is increasingly becoming important. It often needed to implement access...
3822