Description of Service Oriented Access Control Policy Refinement
-
摘要: 策略精化是解决分布式应用访问控制策略配置复杂性的重要方法.现有的策略精化技术给出了分层策略描述和逐层精化的方法,但是描述和处理策略之间关联问题能力不足,影响策略精化应用.为此给出了策略和包括组合、互斥、精化、访问路径协同等策略之间关系的形式描述方法,提出了能够描述策略之间关联属性的精化算法和记录策略和策略之间这些关联属性的策略精化树构建方法,为策略精化中的策略关联问题处理提供基础.策略精化树还能直观呈现访问控制的服务品质协议(service-level agreement, SLA).Abstract: Policy refinement is an important method to resolve the configuration complexity of access control policies for distributed applications. Although the current policy refinement techniques make it possible to describe the layered policies and refine the policies layer by layer, it is not easy of these methods to describe and analyze the associated attributes among different policies. The wide use of policy refinement is thus hindered. In this paper, new methods for the description of policies and relationships among them such as composition, mutual exclusion, refinement and path cooperation are given. A new algorithm for policies refinement with relationship description ability is proposed. A refine-tree construction method with the capability of describing the policies and the relationships among these policies is also proposed with the algorithm. This provides a basis for solving the issue of the associating attributes between policies in the policy refinement process. The policies refine-tree can also be used to demonstrate the SLA (service-level agreement) of access control.
-
-
期刊类型引用(8)
1. 邱朋飞,孙日辉,王春露,汪东升. 现代处理器低功耗漏洞发现与利用. 中国科学:信息科学. 2025(02): 297-325 . 百度学术
2. 徐杰,吴茂雪. 基于数据中心的数据传输网络拓扑结构及拥塞控制研究. 中国高新科技. 2024(21): 27-28+31 . 百度学术
3. 杨帆,张倩颖,施智平,关永. 可信执行环境软件侧信道攻击研究综述. 软件学报. 2023(01): 381-403 . 百度学术
4. 黎秀,潘虹,朱镕申. 移动终端软件高速缓存侧信道脆弱性识别仿真. 计算机仿真. 2022(02): 496-500 . 百度学术
5. 王崇,魏帅,张帆,宋克. 缓存侧信道防御研究综述. 计算机研究与发展. 2021(04): 794-810 . 本站查看
6. 丛眸,张平,王宁. 针对KASLR的Linux计时攻击方法. 计算机工程. 2021(08): 177-182 . 百度学术
7. 高岩,资郴琛,冯四风,顾青. 面向拟态防御理论构造Web网关的安全调度算法. 小型微型计算机系统. 2021(09): 1913-1919 . 百度学术
8. 李志峰,高玉琢. 基于高速缓存的侧信道攻击方法研究. 网络安全技术与应用. 2021(09): 4-7 . 百度学术
其他类型引用(3)
计量
- 文章访问数: 1096
- HTML全文浏览量: 0
- PDF下载量: 731
- 被引次数: 11