A Multivariate Approach for Checking Resiliency in Access Control

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9778)


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 \ge 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|, sdt. 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.


  1. 1.
    Crampton, J., Gutin, G., Watrigant, R.: A multivariate approach for checking resiliency in access control. CoRR: 1604.01550 (2016)Google Scholar
  2. 2.
    Creignou, N.: The class of problems that are linearly equivalent to satisfiability or a uniform method for proving NP-completeness. Theoret. Comput. Sci. 145(1–2), 111–145 (1995)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Cygan, M., Fomin, F.V., Kowalik, L., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer, Switzerland (2015)CrossRefMATHGoogle Scholar
  4. 4.
    Dom, M., Lokshtanov, D., Saurabh, S.: Incompressibility through colors and IDs. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part I. LNCS, vol. 5555, pp. 378–389. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  5. 5.
    Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer, London (2013)CrossRefMATHGoogle Scholar
  6. 6.
    Frank, A., Tardos, É.: An application of simultaneous diophantine approximation in combinatorial optimization. Combinatorica 7(1), 49–65 (1987)MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? J. Comput. Syst. Sci. 63(4), 512–530 (2001)MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    Kannan, R.: Minkowski’s convex body theorem and integer programming. Math. Oper. Res. 12(3), 415–440 (1987)MathSciNetCrossRefMATHGoogle Scholar
  9. 9.
    Lenstra, H.W.: Integer programming with a fixed number of variables. Math. Oper. Res. 8(4), 538–548 (1983)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Li, N., Tripunitara, M.V., Wang, Q.: Resiliency policies in access control. ACM Trans. Inf. Syst. Secur. 12(4), 113–137 (2009)CrossRefGoogle Scholar
  11. 11.
    Sandhu, R.S., Coyne, E.J., Feinstein, H.L., Youman, C.E.: Role-based access control models. IEEE Comput. 29(2), 38–47 (1996)CrossRefGoogle Scholar
  12. 12.
    Wang, Q., Li, N.: Satisfiability and resiliency in workflow authorization systems. ACM Trans. Inf. Syst. Secur. 13(4), 40 (2010)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  • Jason Crampton
    • 1
  • Gregory Gutin
    • 1
  • Rémi Watrigant
    • 1
  1. 1.Royal Holloway University of LondonEghamUK

Personalised recommendations