电子学报2011，Vol.39Issue(7)：1530-1537,8.
访问控制策略中信息流的最优化去环方法
Methods for Optimal Eliminating Cycles in Information Flow of Authorization Policies
摘要
Abstract
Optimal eliminating cycles in Information flow of authorization policies is an important prerequisite to the success of migrating important information systems to multi-level security systems. This paper firstly proves it is a NP-hard problem, then presents optimization algorithm based on dynamic programming and approximate optimization algorithm based on genetic algorithm. Computational complexity analysis and experiments show that the former is fast to find the optimal solution in small-scale environment, the latter is effective to find the approximate optimal solution in large-scale environment.关键词
访问控制策略/信息流/环路/NP难题/动态规划/遗传算法Key words
access control policy/information flow/cycle/NP-hard/dynamic programming/genetic algorithm分类
计算机与自动化引用本文复制引用
杨智,段洣毅,金舒原,殷丽华,郭莉..访问控制策略中信息流的最优化去环方法[J].电子学报,2011,39(7):1530-1537,8.基金项目
基金项目:国家自然科学基金(No.61070186) （No.61070186）
国家863高技术研究发展计划(No.2009AA0IZ438,No.2006AA01Z457) （No.2009AA0IZ438,No.2006AA01Z457）
国家973重点基础研究发展计划(No.2007CB311100) （No.2007CB311100）
