Download PDFOpen PDF in browser

Authorization Enforcement in Workflows: Maintaining Realizability Via Automated Reasoning

14 pagesPublished: August 19, 2013

Abstract

We investigate automated reasoning techniques as a means of supporting authorization enforcement functions of security-aware workflow management systems. The aim of such support is that one may statically or dynamically guarantee the realizability of a workflow instance given the security constraints of the underlying workflow specification. We develop two such automated reasoning methods and experimentally evaluate their suitability for giving such support. One method uses a propositional encoding of realizability implemented through binary decision diagrams, another method uses a linear-time temporal logic encoding implemented via bounded model checking. Preliminary experimental results identify issues of scalability and of balancing flexibility in task allocation with complexity of computing such allocations.

Keyphrases: authorization enforcement functions, binary decision diagrams, ltl model checking, satisfiability, workflow systems

In: Pascal Fontaine, Renate A. Schmidt and Stephan Schulz (editors). PAAR-2012. Third Workshop on Practical Aspects of Automated Reasoning, vol 21, pages 29-42.

BibTeX entry
@inproceedings{PAAR-2012:Authorization_Enforcement_Workflows_Maintaining,
  author    = {Jason Crampton and Michael Huth and Jim Huan-Pu Kuo},
  title     = {Authorization Enforcement in Workflows: Maintaining Realizability Via Automated Reasoning},
  booktitle = {PAAR-2012. Third Workshop on Practical Aspects of Automated Reasoning},
  editor    = {Pascal Fontaine and Renate A. Schmidt and Stephan Schulz},
  series    = {EPiC Series in Computing},
  volume    = {21},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/Rpt},
  doi       = {10.29007/n6nv},
  pages     = {29-42},
  year      = {2013}}
Download PDFOpen PDF in browser