On the parameterized complexity of the workflow satisfiability problem

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 2012, Pages 857-868

  Crampton, Jason ^a   Gutin, Gregory ^a   Yeo, Anders ^b  

^a UNIVERSITY OF LONDON   (United Kingdom)

^b UNIVERSITY OF JOHANNESBURG   (South Africa)

Author keywords

Authorization constraints; Parameterized complexity; Workflow satisfiability

Indexed keywords

AUTHORIZATION CONSTRAINTS; COMPLEXITY BOUNDS; HARD PROBLEMS; PARAMETERIZED COMPLEXITY; REFERENCE MONITORS; RUNTIMES; SATISFIABILITY; SATISFIABILITY PROBLEMS; SECURITY REQUIREMENTS; WORKFLOW MANAGEMENT SYSTEMS; WORKFLOW SPECIFICATION;

ALGORITHMS; FORMAL LOGIC; SECURITY OF DATA; SPECIFICATIONS; STATIC ANALYSIS; WORK SIMPLIFICATION;

EMBEDDED SYSTEMS;

EID: 84869481819     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2382196.2382287     Document Type: Conference Paper

References (17)

1. D.A. Basin, S.J. Burri, and G. Karjoth. Obstruction-free authorization enforcement: Aligning security with business objectives. In Proc. 24th IEEE Symp. on Comput. Sec. Foundations, 99-113, 2011.
2. E. Bertino, E. Ferrari, and V. Atluri. The specification and enforcement of authorization constraints in workflow management systems. ACM Trans. Inf. Syst. Secur. 2(1): 65-104, 1999.
3. A. Björklund, T. Husfeldt, and M. Koivisto. Set partitioning via inclusion-exclusion. SIAM J. Comput. 39(2): 546-563, 2009.
4. H.L. Bodlaender, R.G. Downey, M.R Fellows, and D. Hermelin, On problems without polynomial kernels. J. Comput. Sys. Sci. 75 (2009), 423-434.
5. J. Crampton. A reference monitor for workflow systems with constrained task execution. In Proc. 10th ACM Symp. on Access Control Models and Technologies 38-47, 2005.
6. J. Crampton and M. Huth. Synthesizing and verifying plans for constrained workflows: transferring tools from formal methods. In Proc. 3rd ICAPS Workshop on Verification and Validation of Planning and Scheduling Systems, 2011.
7. R. Crowston, G. Gutin, M. Jones, V. Raman, and S. Saurabh. Parameterized complexity of MaxSat above average. Proc. LATIN 2012, Lect. Notes Comput. Sci. 7256 (2012), 184-194.
8. R.G. Downey and M.R. Fellows. Parameterized Complexity, Springer Verlag, 1999.
9. J. Flum and M. Grohe. Parameterized Complexity Theory, Springer Verlag, 2006.
10. M. Fellows, T. Friedrich, D. Hermelin, N. Narodytska, and F. Rosamond. Constraint satisfaction problems: Convexity makes AllDifferent constraints tractable. In Proc. 27th Intern. Joint Conf. on Artif. Intell. 522-527, 2011.
11. R. Impagliazzo, R. Paturi and F. Zane. Which problems have strongly exponential complexity? J. Comput. Sys. Sci. 63(4): 512-530, 2001.
12. T. Kaufman, M. Krivelevich, and D. Ron. Tight bounds for testing bipartiteness in general graphs. SIAM J. Comput. 33(6): 1441-1483, 2004.
13. D. Lokshtanov, D. Marx, and S. Saurabh. Slightly superexponential parameterized problems. In Proceedings of SODA'2011, 760-776, 2011.
14. J. Moffett and E.C. Lupu. The uses of role hierarchies in access control. In Proceedings of Fourth ACM Workshop on Role-Based Access Control, 153-160, 1999.
15. E. Tsang. Foundations of Constraint Satisfaction, Academic Press, 1993; available at http://en.scientificcommons.org/43256499.
16. W.M.P. van der Aalst, A. ter Hofstede, B. Kiepuszewski, and A. Barros. Workflow patterns. Distributed and Parallel Databases 14(1): 5-51, 2003.
17. Q. Wang and N. Li. Satisfiability and resiliency in workflow authorization systems. ACM Trans. Inf. Syst. Secur. 13(4): 1-35, 2010.