54 citations · 119 across the 24 of their papers we have counts for
7 papers · 1 filter
The Bi-Objective Workflow Satisfiability Problem and Workflow Resiliency
Jason Crampton, Gregory Gutin, Daniel Karapetyan +1
A computerized workflow management system may enforce a security policy, specified in terms of authorized actions and constraints, thereby restricting which users can perform parti…
Relationships, Paths and Principal Matching: A New Approach to Access Control
Jason Crampton, James Sellwood
Recent work on relationship-based access control has begun to show how it can be applied to general computing systems, as opposed to simply being employed for social networking app…
Optimal Constructions for Chain-based Cryptographic Enforcement of Information Flow Policies
Jason Crampton, Naomi Farley, Gregory Gutin +1
The simple security property in an information flow policy can be enforced by encrypting data objects and distributing an appropriate secret to each user. A user derives a suitable…
Algorithms for the workflow satisfiability problem engineered for counting constraints
D. Cohen, J. Crampton, A. Gagarin +2
The workflow satisfiability problem (WSP) asks whether there exists an assignment of authorized users to the steps in a workflow specification that satisfies the constraints in the…
On the Workflow Satisfiability Problem with Class-Independent Constraints
Jason Crampton, Andrei Gagarin, Gregory Gutin +2
A workflow specification defines sets of steps and users. An authorization policy determines for each user a subset of steps the user is allowed to perform. Other security requirem…
Relationship-Based Access Control for OpenMRS
Syed Zain Rizvi, Philip W. L. Fong, Jason Crampton +1
Inspired by the access control models of social network systems, Relationship-Based Access Control (ReBAC) was recently proposed as a general-purpose access control paradigm for ap…