| 本文已被：浏览 6545次 下载 7853次 |
码上扫一扫！ |
|
|
| 多级安全中敏感标记的最优化挖掘 |
|
杨智1,2,3, 金舒原1,4, 段洣毅1, 方滨兴1,4
|
|
1.中国科学院 计算技术研究所,北京 100190;2.中国科学院 研究生院,北京 100049;3.信息工程大学 电子技术学院,河南 郑州 450004;4.信息内容安全技术国家工程实验室,北京 100190
|
|
| 摘要: |
| 提出了一种自底向上的方法来实现系统迁移过程中自动和科学的访问控制策略转换.首先对多级安全中敏感标记最优化挖掘问题作了形式化描述,证明了该问题是NP 完全问题,不存在多项式时间算法.然后,在此基础上提出了基于层次聚类和遗传算法的近似最优化挖掘算法,将该问题分解为范畴划分和密级分配两个阶段.最后,实验结果表明,算法能够有效地挖掘出最优的敏感标记.该方法可以应用于等级保护工作中的系统迁移工程. |
| 关键词: 多级安全 敏感标记 最优化挖掘 计算复杂度 层次聚类算法 遗传算法 |
| DOI：10.3724/SP.J.1001.2011.03823 |
| 分类号: |
| 基金项目:国家自然科学基金(60703021); 国家高技术研究发展计划(863)(2009AA01Z438, 2009AA01Z431, 2006AA01Z457);国家重点基础研究发展计划(973)(2007CB311100) |
|
| Optimal Mining on Security Labels in Multilevel Security System |
|
YANG Zhi1,2,3, JIN Shu-Yuan1,4, DUAN Mi-Yi1, FANG Bin-Xing1,4
|
|
1.Institute of Computing Technology, The Chinese Academy of Sciences, Beijing 100190, China;2.Graduate University, The Chinese Academy of Sciences, Beijing 100049, China;3.Institute of Electronic Technology, Information Engineering University, Zhengzhou 45000;4.National Engineering Laboratory for Information Security Technologies, Beijing 100190, China
|
| Abstract: |
| This paper presents a bottom-up approach to implement the automatic and scientific transform of access control policies in the migration. First, the problem of mining security labels optimally is described formally, and it is then proved to be NP-complete. Next, an approximate optimization algorithm based on hierarchical clustering and genetic algorithm is presented, which decomposes the problem into two parts: category partition and secret level assignation. Finally, experimental results show that the algorithm is effective in finding an optimal solution. The proposed approach can be applied to migration projects in hierarchy protection in information security. |
| Key words: multilevel security security label optimal mining computational complexity hierarchical clustering algorithm genetic algorithm |
