Resilient Delegation Revocation with Precedence for Predecessors Is NP-Complete.
Marcos CramerPieter Van HertumRuben LapauwIngmar DassevilleMarc DeneckerPublished in: CSF (2016)
Keyphrases
- np complete
- access control
- np hard
- satisfiability problem
- randomly generated
- computational complexity
- partial order
- security policies
- constraint satisfaction problems
- role based access control
- bounded treewidth
- pspace complete
- data complexity
- polynomial time complexity
- precedence constraints
- resource constraints
- conflict resolution
- security mechanisms
- conjunctive queries
- scheduling problem
- access control systems
- conp complete
- precedence relations
- access control policies
- cross domain
- lower bound
- polynomially solvable
- multi agent