On Run-Time Enforcement of Authorization Constraints in Security-Sensitive Workflows

Santos, Daniel Ricardo dos; Ranise, Silvio

doi:10.1007/978-3-319-66197-1_13

Cited by 3 publications

(4 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The WSP in all its generality is a problem with complicated constraints which may require a certain partial order in which the steps are performed, exclusion of certain steps from being performed by a plan under certain conditions, etc., see e.g. [5], [6], [7], [8]. However, it is possible to reduce such a general WSP to a number of more basic WSPs in which there are no constraints imposing a partial order of the steps (i.e.…”

Section: General-case Workflow Satisfiability Problemmentioning

confidence: 99%

“…if U are users in some hierarchical organisation), which is rather restrictive. Dos Santos and Ranise [8] developed a software tool for the software company SAP which can be used to work, in particular, with the run-time version of the WSP which has UI and CI constraints. Apart from SAT and Constraint Satisfaction Problem solvers used in [15], [16], many researchers studied WSP satisfiability using solvers based on Satisfiability Modulo Theories and Optimization Modulo Theories, see e.g.…”

Section: Special Cases Of Wspmentioning

confidence: 99%

“…Apart from SAT and Constraint Satisfaction Problem solvers used in [15], [16], many researchers studied WSP satisfiability using solvers based on Satisfiability Modulo Theories and Optimization Modulo Theories, see e.g. [5], [8]. We refer the reader to [19], [20] for surveys on workflow satisfiability approaches.…”

Section: Special Cases Of Wspmentioning

confidence: 99%

“…User-Dependent Pseudo-Boolean (UDPB) representation consists of Boolean variables x s,u for s ∈ S and u ∈ U , where x s,u = 1 iff step s is assigned to user u. 8 . This formulation was first used in [15] and it enables convenient formulation of many constraints.…”

Section: Solution Representationsmentioning

confidence: 99%

See 3 more Smart Citations

Solving the Workflow Satisfiability Problem using General Purpose Solvers

Karapetyan¹,

Gutin²

2021

Preprint

View full text Add to dashboard Cite

The workflow satisfiability problem (WSP) is a well-studied problem in access control seeking allocation of authorised users to every step of the workflow, subject to workflow specification constraints. It was noticed that the number k of steps is typically small compared to the number of users in the real-world instances of WSP; therefore k is considered as the parameter in WSP parametrised complexity research. While WSP in general was shown to be W[1]-hard, WSP restricted to a special case of user-independent (UI) constraints is fixed-parameter tractable (FPT). However, restriction to the UI constraints might be impractical. To efficiently handle non-UI constraints, we introduce the notion of branching factor of a constraint. As long as the branching factors of the constraints are relatively small and the number of non-UI constraints is reasonable, WSP can be solved in FPT time. Extending the results from Karapetyan et al. ( 2019), we demonstrate that general-purpose solvers are capable of achieving FPT-like performance on WSP with arbitrary constraints when used with appropriate formulations. This enables one to tackle most of practical WSP instances. While important on its own, we hope that this result will also motivate researchers to look for FPT-aware formulations of other FPT problems.

show abstract