Access Control

The Workflow Satisfiability Problem (WSP) is the Constraint Satisfiability Problem parametrised by the number of variables. WSP is of interest in Access Control, and here is a list of papers on WSP. Preliminary versions of most of these papers can be found in arXiv.

• J. Crampton, A. Gagarin, G. Gutin, M. Jones, and M. Wahlstrom, On the Workflow Satisfiability Problem with Class-Independent Constraints for Hierarchical Organizations. To appear in ACM Transactions on Privacy and Security.

• D. Cohen, J. Crampton, A. Gagarin, G. Gutin and M. Jones, Algorithms for the workflow satisfiability problem engineered for counting constraints. J. Combin. Optim. 32 (2016), 3—24.

• G. Gutin, S. Kratsch and M. Wahlstrom, Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem. Algorithmica 75(2) (2016), 383—402.

• G. Gutin and M. Wahlstrom, Tight Lower Bounds for the Workflow Satisfiability Problem Based on the Strong Exponential Time Hypothesis. Inform. Proc. Lett. 116 (2016), 223—226.

• J. Crampton, G. Gutin and R. Watragant, A Multivariate Approach for Checking Resiliency in Access Control. AAIM 2016, Lect. Notes Comput. Sci. 9778 (2016), 173—184.

• J. Crampton, G. Gutin and R. Watragant, Resiliency Policies in Access Control Revisited. ACM SACMAT 2016, 101—111. (best paper award)

• Jason Crampton, Gregory Gutin, Daniel Karapetyan, Valued Workflow Satisfiability Problem, ACM SACMAT 2015, 3—13. (best paper award)

• J. Crampton, A. Gagarin, G. Gutin and M. Jones, On the Workflow Satisfiability Problem with Class-Independent Constraints. IPEC 2015, LIPICS 43 (2015) 66—77.

• Daniel Karapetyan, Andrei Gagarin, Gregory Gutin, Pattern Backtracking Algorithm for the Workflow Satisfiability Problem, FAW 2015 , Lect. Notes Comput. Sci. 9130 (2015), 138—149.

• D. Cohen, J. Crampton, A. Gagarin, G. Gutin and M. Jones, Iterative Plan Construction for the Workflow Satisfiability Problem. J. Artif. Intel. Res. 51 (2014), 555—577.

• J. Crampton, G. Gutin, and A. Yeo, On the parameterized complexity and kernelization of the workflow satisfiability problem. ACM Trans. Inf. Syst. Secur. 16(1), article 4 (2013).

• J. Crampton, R. Crowston, G. Gutin, M. Jones, and Ramanujan M.S., Fixed-Parameter Tractability of Workflow Satisfiability in the Presence of Seniority Constraints. In FAW-AAIM 2013, Lect. Notes Comput. Sci. 7924 (2013), 198-209.

• J. Crampton and G. Gutin, Constraint Expressions and Workflow Satisfiability. In 18th ACM SACMAT (2013), 73-84.

• Q. Wang and N. Li, Satisfiability and resiliency in workflow authorization systems. ACM Trans. Inf. Syst. Secur. 13(4), article 40 (2010).