Hard Instances for Verification Problems in Access Control


We address the generation and analysis of hard instances for verification problems in access control that are NP-hard. Given the customary assumption that P ≠ NP, we know that such classes exist. We focus on a particular problem, the user-authorization query problem (UAQ) in Role-Based Access Control (RBAC). We show how to systematically generate hard… (More)
DOI: 10.1145/2752952.2752959


3 Figures and Tables

Slides referencing similar topics