Workflow authorisation in mediator-free environments

  • Authors:

  • Mohamed Shehab;Elisa Bertino;Arif Ghafoor

  • Affiliations:

  • Department of Electrical and Computer Engineering and Center for Education and Research in Information Assurance and Security (CERIAS), Purdue University, West Lafayette, IN, USA.;Department of Computer Science, Electrical and Computer Engineering and CERIAS, Purdue University, West Lafayette, IN, USA.;Electrical and Computer Engineering and CERIAS, Purdue University, West Lafayette, IN, USA

  • Venue:
  • International Journal of Security and Networks
  • Year:
  • 2006

Quantified Score

Hi-index 0.01

Visualization

Abstract

WorkFlow Management Systems (WFMS) coordinate and streamline business processes. Acquiring workflow authorisations and managing workflow authorisation constraints is a challenging problem. Current WFMSs assume a centralised global workflow authorisation model. In this paper, we propose a distributed workflow authorisation model with no central authorisation manager for a mediator-free environment. We provide an on-demand task discovery protocol that enables domains to discover tasks available in other domains. We formulate the workflow authorisation problem as a constraint satisfaction problem to select access paths that satisfy all the workflow authorisation constraints. We propose the Workflow Minimal Authorisation Problem (WMAP), which selects minimal authorisations required to execute the workflowtasks. In addition, we investigate access path overlaps to allow tasks in the same session to share authorisations and we present the Workflow Minimal Authorisation Problem with path Overlaps (WMAPO). Finally, we formulate integer programmes to solve both the WMAP and WMAPO.