A multivariate approach for checking resiliency in access control

DOI10.1007/978-3-319-41168-2_15MaRDI QIDQ2830068zbMATH OpenOpenAlexFDO

Authors J. Crampton, G. Gutin, Rémi Watrigant

Publication date 9 November 2016

Published in Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1604.01550

Mathematics Subject Classification ID

Computer security (68M25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Parameterized complexity, tractability and kernelization (68Q27) Combinatorics in computer science (68R05)

Abstract: In recent years, several combinatorial problems were introduced in the area of access control. Typically, such problems deal with an authorization policy, seen as a relation $URsubseteqUimesR$, where $(u,r)inUR$ means that user $u$ is authorized to access resource $r$. Li, Tripunitara and Wang (2009) introduced the Resiliency Checking Problem (RCP), in which we are given an authorization policy, a subset of resources $PsubseteqR$, as well as integers $sge0$, $dge1$ and $tgeq1$. It asks whether upon removal of any set of at most $s$ users, there still exist $d$ pairwise disjoint sets of at most $t$ users such that each set has collectively access to all resources in $P$. This problem possesses several parameters which appear to take small values in practice. We thus analyze the parameterized complexity of RCP with respect to these parameters, by considering all possible combinations of $|P|,s,d,t$. In all but one case, we are able to settle whether the problem is in FPT, XP, W[2]-hard, para-NP-hard or para-coNP-hard. We also consider the restricted case where $s=0$ for which we determine the complexity for all possible combinations of the parameters.

Recommendations

• Parameterized resiliency problems
• Parameterized resiliency problems via integer linear programming
• On the decidability of the safety problem for access control policies
• Policy analysis for administrative role-based access control
• Information Security

Cites work

• A multivariate approach for checking resiliency in access control
• An application of simultaneous diophantine approximation in combinatorial optimization
• Fundamentals of parameterized complexity
• Incompressibility through Colors and IDs
• Integer Programming with a Fixed Number of Variables
• Minkowski's Convex Body Theorem and Integer Programming
• Parameterized algorithms
• The class of problems that are linearly equivalent to Satisfiability or a uniform method for proving NP-completeness
• Which problems have strongly exponential complexity?

Cited in

(3)

• Parameterized resiliency problems
• A multivariate approach for checking resiliency in access control
• Parameterized resiliency problems via integer linear programming

This page was built for publication: A multivariate approach for checking resiliency in access control

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2830068)