Greedy algorithm for least privilege in RBAC model

DOI10.1007/978-3-642-22616-8_42MaRDI QIDQ5199177zbMATH OpenOpenAlexFDO

Authors Jinling Liu, H.-J. Huang, Hongwei Du

Publication date 12 August 2011

Published in Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-22616-8_42

zbMATH Keywords

greedy algorithmNP-hardperformance ratioleast privilege

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Network design and communication in computer systems (68M10)

Recommendations

• Handling least privilege problem and role mining in RBAC
• scientific article; zbMATH DE number 2100553
• Information Security and Privacy
• scientific article; zbMATH DE number 5622717
• On the complexity of role updating feasibility problem in RBAC

Cited in

(1)

• Handling least privilege problem and role mining in RBAC

This page was built for publication: Greedy algorithm for least privilege in RBAC model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5199177)