Authorization query method for RBAC based on partial MAX-SAT solver

Abstract

In order to ensure system security and reflect availability in authorization management,a method for querying authorization was proposed based on solvers for partial maximal satisfiability problem.Static authorization descriptions and dynamic mutually exclusive constraints were translated into hard clauses.The algorithm was adopted to update hard clauses and translate requested permissions into soft clauses.Soft clauses were effectively encoded,and the recursive algorithm was utilized to satisfy all hard clauses and as many soft clauses as possible.The experimental results show that the method can ensure system security,it follows the least privilege principle,and the query efficiency outperforms solvers for maximal satisfiability problem.