On the Parameterized Complexity and Kernelization of the Workflow Satisfiability Problem

@article{Crampton2013OnTP,
  title={On the Parameterized Complexity and Kernelization of the Workflow Satisfiability Problem},
  author={Jason Crampton and Gregory Gutin and Anders Yeo},
  journal={ACM Trans. Inf. Syst. Secur.},
  year={2013},
  volume={16},
  pages={4:1-4:31}
}
  • Jason Crampton, Gregory Gutin, Anders Yeo
  • Published in TSEC 2013
  • Computer Science
  • ACM Trans. Inf. Syst. Secur.
  • A workflow specification defines a set of steps and the order in which these steps must be executed. Security requirements may impose constraints on which groups of users are permitted to perform subsets of these steps. A workflow specification is said to be satisfiable if there exists an assignment of users to workflow steps that satisfies all the constraints. An algorithm for determining whether such an assignment exists is important, both as a static analysis tool for workflow specifications… CONTINUE READING

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 39 CITATIONS

    On the satisfiability of authorization requirements in business process

    VIEW 4 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem

    VIEW 9 EXCERPTS
    CITES RESULTS & BACKGROUND

    Last man standing: Static, decremental and dynamic resiliency via controller synthesis

    VIEW 4 EXCERPTS
    CITES METHODS & BACKGROUND
    HIGHLY INFLUENCED

    Results in Workflow Resiliency: Complexity, New Formulation, and ASP Encoding

    VIEW 13 EXCERPTS
    CITES METHODS & BACKGROUND
    HIGHLY INFLUENCED

    Results in Workflow Resiliency

    VIEW 13 EXCERPTS
    CITES METHODS & BACKGROUND
    HIGHLY INFLUENCED

    The Authorization Policy Existence Problem

    VIEW 4 EXCERPTS
    CITES BACKGROUND & METHODS

    Tools and techniques for analysing the impact of information security

    VIEW 4 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    Tight lower bounds for the Workflow Satisfiability Problem based on the Strong Exponential Time Hypothesis

    VIEW 4 EXCERPTS
    CITES BACKGROUND & METHODS

    References

    Publications referenced by this paper.
    SHOWING 1-5 OF 5 REFERENCES

    Satisfiability and Resiliency in Workflow Authorization Systems

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    Parameterized Complexity Theory

    • Jörg Flum, Martin Grohe
    • Mathematics, Computer Science
    • Texts in Theoretical Computer Science. An EATCS Series
    • 2006
    VIEW 6 EXCERPTS
    HIGHLY INFLUENTIAL

    Role-Based Access Control Models

    VIEW 9 EXCERPTS
    HIGHLY INFLUENTIAL

    A generalized temporal role-based access control model

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    ANSI INCITS 359-2004 for Role Based Access Control

    • American National Standards Institute
    • American National Standards Institute.
    • 2004
    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL