Specification and Enforcement of Separation-of-Duty Policies in Role-base Access Control

被引:0
作者
Lu, Jianfeng [1 ]
Zhou, Jiaqing [1 ]
机构
[1] Zhejiang Normal Univ, Sch Math Phys & Informat Engn, Jinhua 321004, Zhejiang, Peoples R China
来源
2011 INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND NETWORK TECHNOLOGY (ICCSNT), VOLS 1-4 | 2012年
关键词
Separation of Duty; RBAC; SAT4J;
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Separation-of-duty (SoD) is widely considered to be a fundamental principle to role based access control (RBAC) models and systems should adhere. In this paper, we formulate and study the fundamental problem of SoD policies in the context of RBAC systems. We give a set-based specification of SoD policies and the safety checking problem for SoD policies in the context of RBAC. We study the problem of determining whether a SoD policy is enforceable, and show that directly enforcing SoD policies in RBAC is intractable (coNP-complete). Moreover, indirectly enforcing SoD policies by using mutually exclusive role constraints is also intractable (NP-hard). Therefore, we reduce the safety checking problem for SoD to SAT4J problem which can be solved using available SAT solvers. The experiments show the validity and effectively of the SAT approach.
引用
收藏
页码:2135 / 2140
页数:6
相关论文
共 12 条
  • [1] [Anonymous], 2004, 3592004 ANSI INCITS
  • [2] BERRE DL, 2006, SAT4J SATISFIABILITY
  • [3] CHEN L, 2009, P 14 EUR S RES COMP, P689
  • [4] Ferraiolo D. E., 1995, Proceedings. 11th Annual Computer Security Applications Conference, P241
  • [5] Ferraiolo DF, 2003, ARTECH H COMP SEC LI
  • [6] On the formal definition of separation-of-duty policies and their composition
    Gligor, VD
    Gavrila, SI
    Ferraiolo, D
    [J]. 1998 IEEE SYMPOSIUM ON SECURITY AND PRIVACY - PROCEEDINGS, 1998, : 172 - 183
  • [7] Li N., 2009, ACM T INFORM SYST SE, V12, P113
  • [8] Li N., 2007, ACM T INFORM SYST SE, V10, P231
  • [9] Beyond proof-of-compliance: Security analysis in trust management
    Li, NH
    Mitchell, JC
    Winsborough, WH
    [J]. JOURNAL OF THE ACM, 2005, 52 (03) : 474 - 514
  • [10] Papadimitriou C. H., 1994, Computational Complexity