Abstract

Abstract This paper introduces the notion of safety and availability checking for user authorization query processing, and develop a recursive algorithm use the ideas from backtracking-based search techniques to search for the optimal solution. For the availability checking, we introduce the notion of max activatable set (MAS), and show formally how MAS can be determined in a hybrid role hierarchy. For the safety checking, we give a formal definition of dynamic separation-of-duty (DSoD) policies, and show how to reduce the safety checking for DSoD to a SAT instance.

Highlights

  • Jian-feng Lu, et al step, the algorithm uses a greedy search to find a role set that cover the desired permissions while following the least privilege principle

  • Based on the above discussion, in this paper, we present an efficient approach for solving the problem of safety and availability checking for user authorization query processing in RBAC systems

  • The contributions of this paper include the following: We introduce the notion of safety and availability checking for user authorization query (SAC-User Authorization Query (UAQ)) processing in RBAC systems extended with hybrid role hierarchy

Read more

Summary

Introduction

Jian-feng Lu, et al step, the algorithm uses a greedy search to find a role set that cover the desired permissions while following the least privilege principle. They referred to this as the role mapping problem. The algorithm’s ideas come from DPLL algorithm for SAT7, it considers the effect of DSoD constraints and can choose a set of roles satisfying the safety checking. They assumed that issues of hybrid hierarchies are handled in the generation of the UAQ instances, and there is no availability checking. The DSoD constraints were considered in reference 6 is dynamic mutually exclusive role (DMER) constraints, the distinction between DSoD policies as objectives and DMER constraints as a mechanism is not clearly 8

The Main Text Problem Definition
Max Activatable Set
Safety Checking for DSoD policies
A Recursive Algorithm for SAC-UAQ
18: Rsol Rsol Rsel
Evaluation and Illustration
Comparison with Greedy Approach
Comparison with Brute-Force Approach
Conclusions

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.