Tight lower bounds for the Workflow Satisfiability Problem based on the Strong Exponential Time Hypothesis

The Workflow Satisfiability Problem (WSP) is a problem used in access control.The WSP is parameterized by the number of steps.The WSP is considered for regular and user-independent constraints.Tight lower bounds are proved for WSP algorithms with the two types of constraints. The Workflow Satisfiability Problem (WSP) asks whether there exists an assignment of authorized users to the steps in a workflow specification, subject to certain constraints on the assignment. The problem is NP-hard even when restricted to just not equal constraints. Since the number of steps k is relatively small in practice, Wang and Li (2010) 21 introduced a parametrisation of WSP by k. Wang and Li (2010) 21 showed that, in general, the WSP is W1-hard, i.e., it is unlikely that there exists a fixed-parameter tractable (FPT) algorithm for solving the WSP. Crampton et al. (2013) 10 and Cohen et al. (2014) 6 designed FPT algorithms of running time O * ( 2 k ) and O * ( 2 k log 2 ? k ) for the WSP with so-called regular and user-independent constraints, respectively. In this note, we show that there are no algorithms of running time O * ( 2 c k ) and O * ( 2 c k log 2 ? k ) for the two restrictions of WSP, respectively, with any c < 1 , unless the Strong Exponential Time Hypothesis fails.

[1]  Dániel Marx,et al.  Known algorithms on graphs of bounded treewidth are probably optimal , 2010, SODA '11.

[2]  Ninghui Li,et al.  Satisfiability and Resiliency in Workflow Authorization Systems , 2010, TSEC.

[3]  Yoshio Okamoto,et al.  On Problems as Hard as CNF-SAT , 2011, 2012 IEEE 27th Conference on Computational Complexity.

[4]  Silvio Ranise,et al.  Assisting the Deployment of Security-Sensitive Workflows by Finding Execution Scenarios , 2015, DBSec.

[5]  Elisa Bertino,et al.  The specification and enforcement of authorization constraints in workflow management systems , 1999, TSEC.

[6]  Russell Impagliazzo,et al.  On the Complexity of k-SAT , 2001, J. Comput. Syst. Sci..

[7]  Michael R. Fellows,et al.  Review of: Fundamentals of Parameterized Complexity by Rodney G. Downey and Michael R. Fellows , 2015, SIGA.

[8]  Gregory Gutin,et al.  Pattern Backtracking Algorithm for the Workflow Satisfiability Problem with User-Independent Constraints , 2015, FAW.

[9]  Gregory Gutin,et al.  Iterative Plan Construction for the Workflow Satisfiability Problem , 2013, J. Artif. Intell. Res..

[10]  Elisa Bertino,et al.  TRBAC: a temporal role-based access control model , 2000, RBAC '00.

[11]  David Basin,et al.  Obstruction-free Authorization Enforcement , 2011 .

[12]  Michal Pilipczuk,et al.  Parameterized Algorithms , 2015, Springer International Publishing.

[13]  Gregory Gutin,et al.  Algorithms for the workflow satisfiability problem engineered for counting constraints , 2015, Journal of Combinatorial Optimization.

[14]  Gregory Gutin,et al.  Valued Workflow Satisfiability Problem , 2015, SACMAT.

[15]  Russell Impagliazzo,et al.  Which problems have strongly exponential complexity? , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[16]  Jason Crampton.  A reference monitor for workflow systems with constrained task execution , 2005, SACMAT '05.

[17]  Gregory Gutin,et al.  On the Parameterized Complexity and Kernelization of the Workflow Satisfiability Problem , 2013, TSEC.

[18]  Ravi S. Sandhu,et al.  Role-Based Access Control Models , 1996, Computer.

[19]  Elisa Bertino,et al.  A generalized temporal role-based access control model , 2005, IEEE Transactions on Knowledge and Data Engineering.

[20]  Amir Abboud,et al.  Popular Conjectures Imply Strong Lower Bounds for Dynamic Problems , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.