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.
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 callDisclaimer: 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.
