activity
20092023
most citedSystems of Linear Equations over and Problems Parameterized Above Average

38 citations · 173 across the 47 of their papers we have counts for

collaborators
Showing cs.CRShow all

5 papers · 1 filter

cs.CR2016

Cryptographic Enforcement of Information Flow Policies without Public Information via Tree Partitions

Jason Crampton, Naomi Farley, Gregory Gutin +2

We may enforce an information flow policy by encrypting a protected resource and ensuring that only users authorized by the policy are able to decrypt the resource. In most schemes…

cs.CR2015

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…

cs.CR2015★ 4 cited

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…

cs.CR2014★ 1 cited

Cryptographic Enforcement of Information Flow Policies without Public Information

Jason Crampton, Naomi Farley, Gregory Gutin +2

Cryptographic access control has been studied for over 30 years and is now a mature research topic. When symmetric cryptographic primitives are used, each protected resource is enc…

cs.CR2012★ 2 cited

Fixed-Parameter Tractability of Workflow Satisfiability in the Presence of Seniority Constraints

J. Crampton, R. Crowston, G. Gutin +2

The workflow satisfiability problem is concerned with determining whether it is possible to find an allocation of authorized users to the steps in a workflow in such a way that all…