The Consistency of Task-Based Authorization Constraints in Workflow Systems

  • Authors:
  • Kaijun Tan;Jason Crampton;Carl A. Gunter

  • Affiliations:
  • University of Pennsylvania;University of London;University of Pennsylvania

  • Venue:
  • CSFW '04 Proceedings of the 17th IEEE workshop on Computer Security Foundations
  • Year:
  • 2004

Quantified Score

Hi-index 0.01

Visualization

Abstract

Workflow management systems (WFMSs) have attracteda lot of interest both in academia and the business community.A workflow consists of a collection of tasks that areorganized to facilitate some business process specification.To simplify the complexity of security administration, it iscommon to use role-based access control (RBAC) to grantauthorization to roles and users. Typically, security policiesare expressed as constraints on users, roles, tasks and theworkflow itself. A workflow system can become very complexand involve several organizations or different units ofan organization, thus the number of security policies may bevery large and their interactions very complex. It is clearlyimportant to know whether the existence of such constraintswill prevent certain instances of the workflow from completing.Unfortunately, no existing constraint models have consideredthis problem satisfactorily.In this paper we define a model for constrained workflowsystems that includes local and global cardinality constraints,separation of duty constraints and binding of dutyconstraints. We define the notion of a workflow specificationand of a constrained workflow authorization schema.Our main result is to establish necessary and sufficient conditionsfor the set of constraints that ensure a sound constrainedworkflow authorization schema, that is, for anyuser or any role who are authorized to a task, there is atleast one complete workflow instance when this user or thisrole executes this task.