Verification and enforcement of access control policies

被引:14
作者
Cau, Antonio [1 ]
Janicke, Helge [1 ]
Moszkowski, Ben [1 ]
机构
[1] De Montfort Univ, Software Technol Res Lab, Leicester LE1 9BH, Leics, England
关键词
Access control policy; Policy enforcement; Policy verification; Binary decision diagram; TEMPORAL LOGIC; DERIVATIVES;
D O I
10.1007/s10703-013-0187-3
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Access control mechanisms protect critical resources of systems from unauthorized access. In a policy-based management approach, administrators define user privileges as rules that determine the conditions and the extent of users' access rights. As rules become more complex, analytical skills are required to identify conflicts and interactions within the rules that comprise a system policy-especially when rules are stateful and depend on event histories. Without adequate tool support such an analysis is error-prone and expensive. In consequence, many policy specifications are inconsistent or conflicting that render the system insecure. The security of the system, however, does not only depend on the correct specification of the security policy, but in a large part also on the correct interpretation of those rules by the system's enforcement mechanism. In this paper, we show how policy rules can be formalized in Fusion Logic, a temporal logic for the specification of behavior of systems. A symbolic decision procedure for Fusion Logic based on Binary Decision Diagrams (BDDs) is provided and we introduce a novel technique for the construction of enforcement mechanisms of access control policy rules that uses a BDD encoded enforcement automaton based on input traces which reflect state changes in the system. We provide examples of verification of policy rules, such as absence of conflicts, and dynamic separation of duty and of the enforcement of policies using our prototype implementation (FLCheck) for which we detail the underlying theory.
引用
收藏
页码:450 / 492
页数:43
相关论文
共 68 条
  • [1] Abadi M., 2003, 10 ANN NETW DISTR SY, P1
  • [2] [Anonymous], 2001, ACM Trans. Comput. Log., DOI [DOI 10.1145/371282.371311, 10.1145/371282.371311]
  • [3] [Anonymous], 2005, EXTENSIBLE ACCESS CO
  • [4] [Anonymous], 1983, THESIS
  • [5] [Anonymous], 1993, Symbolic Model Checking
  • [6] Partial derivatives of regular expressions and finite automaton constructions
    Antimirov, V
    [J]. THEORETICAL COMPUTER SCIENCE, 1996, 155 (02) : 291 - 319
  • [7] Bahrak B., 2010, P IEEE S NEW FRONT D, P1
  • [8] Bandara AK, 2007, HANDBOOK OF NETWORK
  • [9] Bertino E., 2001, ACM Transactions on Information and Systems Security, V4, P191, DOI 10.1145/501978.501979
  • [10] BRYANT RE, 1986, IEEE T COMPUT, V35, P677, DOI 10.1109/TC.1986.1676819