访问控制弹性的多元检验方法
A Multivariate Approach for Checking Resiliency in Access Control
摘要：
近年来，一些组合问题被引入到访问控制领域。通常，这样的问题处理授权策略，被视为关系$UR \subseteq U \times R$，其中$(u, r) \in UR$意味着用户$u$被授权访问资源$r$。Li，Tripunitara和Wang（2009）介绍了弹性检查问题（RCP），其中我们给出了授权策略，资源的子集$P \subseteq R$，以及整数$s \ge 0$，$d \ge 1$和$t \geq 1$。它询问在移除至多$s$用户的任何集合时，是否仍然存在至多$t$用户的$d$成对不相交集合，使得每个集合可以共同访问$P$中的所有资源。这个问题有几个参数，在实践中似乎采取小的值。因此，我们分析了RCP的参数化的复杂性相对于这些参数，通过考虑所有可能的组合$|P|, s, d, t$。除了一种情况外，我们都能够解决问题是FPT，XP，W[2]-hard，para-NP-hard还是para-coNP-hard。我们还考虑限制的情况下，其中$s=0$，我们确定的复杂性的所有可能的参数组合。
英文摘要：
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 $UR \subseteq U \times R$, where $(u, r) \in UR$ 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 $P \subseteq R$, as well as integers $s \ge 0$, $d \ge 1$ and $t \geq 1$. 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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
