A Workflow Criticality-Based Approach to Bypass the Workflow Satisfiability Problem

被引:3
|
作者
Boughrous, Monsef [1 ]
El Bakkali, Hanan [1 ]
机构
[1] Mohammed V Univ Rabat, Rabat It Ctr, Smart Syst Lab SSL, ENSIAS, Rabat, Morocco
关键词
MODEL;
D O I
10.1155/2021/3330923
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Workflow management systems are very important for any organization to manage and model complex business processes. However, significant work is needed to keep a workflow resilient and secure. Therefore, organizations apply a strict security policy and enforce access control constraints. As a result, the number of available and authorized users for the workflow execution decreases drastically. Thus, in many cases, such a situation leads to a workflow deadlock situation, where there no available authorized user-task assignments for critical tasks to accomplish the workflow execution. In the literature, this problem has gained interest of security researchers in the recent years, and is known as the workflow satisfiability problem (WSP). In this paper, we propose a new approach to bypass the WSP and to ensure workflow resiliency and security. For this purpose, we define workflow criticality, which can be used as a metric during run-time to prevent WSP. We believe that the workflow criticality value will help workflow managers to make decisions and start a mitigation solution in case of a critical workflow. Moreover, we propose a delegation process algorithm (DP) as a mitigation solution that uses workflow instance criticality, delegation, and priority concepts to find authorized and suitable users to perform the critical task with low-security risks.
引用
收藏
页数:15
相关论文
共 50 条
  • [1] Constraint Branching in Workflow Satisfiability Problem
    Gutin, Gregory
    Karapetyan, Daniel
    SACMAT'20: PROCEEDINGS OF THE 25TH ACM SYMPOSIUM ON ACCESS CONTROL MODELS AND TECHNOLOGIES, 2020, : 93 - 103
  • [2] The bi-objective workflow satisfiability problem and workflow resiliency 1
    Crampton J.
    Gutin G.
    Karapetyan D.
    Watrigant R.
    Journal of Computer Security, 2017, 25 (01) : 83 - 115
  • [3] Pattern-Based Approach to the Workflow Satisfiability Problem with User-Independent Constraints
    Karapetyan, Daniel
    Parkes, Andrew J.
    Gutin, Gregory
    Gagarin, Andrei
    JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2019, 66 : 85 - 122
  • [4] Iterative plan construction for the workflow satisfiability problem
    Cohen, David, 1600, AI Access Foundation (51):
  • [5] Iterative Plan Construction for the Workflow Satisfiability Problem
    Cohen, David
    Crampton, Jason
    Gagarin, Andrei
    Gutin, Gregory
    Jones, Mark
    JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2014, 51 : 555 - 577
  • [6] On the Parameterized Complexity and Kernelization of the Workflow Satisfiability Problem
    Crampton, Jason
    Gutin, Gregory
    Yeo, Anders
    ACM TRANSACTIONS ON INFORMATION AND SYSTEM SECURITY, 2013, 16 (01)
  • [7] Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem
    Gutin, Gregory
    Kratsch, Stefan
    Wahlstroem, Magnus
    ALGORITHMICA, 2016, 75 (02) : 383 - 402
  • [8] Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem
    Gutin, Gregory
    Kratsch, Stefan
    Wahlstroem, Magnus
    PARAMETERIZED AND EXACT COMPUTATION, IPEC 2014, 2014, 8894 : 208 - 220
  • [9] Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem
    Gregory Gutin
    Stefan Kratsch
    Magnus Wahlström
    Algorithmica, 2016, 75 : 383 - 402
  • [10] Algorithms for the workflow satisfiability problem engineered for counting constraints
    Cohen, D.
    Crampton, J.
    Gagarin, A.
    Gutin, G.
    Jones, M.
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2016, 32 (01) : 3 - 24