arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1903.07530cs.CR
收藏

一种有效的可扩展策略挖掘算法

Efficient and Extensible Policy Mining for Relationship-Based Access Control

Thang Bui, Scott D. Stoller, Hieu Le

摘要:

基于规则的访问控制(ReBAC)是一个灵活的和富有表现力的框架,它允许用实体之间的关系链以及实体的属性来表示策略。ReBAC策略挖掘算法有可能通过部分自动化ReBAC策略的开发来显着降低从传统访问控制系统迁移到ReBAC的成本。现有的ReBAC策略挖掘算法支持一种具有有限操作符集的策略语言,这限制了它们的适用性。本文提出了一种ReBAC策略挖掘算法,该算法设计为(1)易于扩展(以支持其他策略语言功能)和(2)可扩展。该算法是基于Bui等人。的ReBAC策略挖掘算法的进化算法。首先,我们简化了他们的算法,以使其更容易扩展,并提供一种方法,扩展它来处理新的策略语言功能。然而,扩展策略语言增加了由进化算法探索的候选策略的搜索空间,从而导致更长的运行时间和/或更差的结果。为了解决这个问题,我们增强了算法的特征选择阶段。该增强利用神经网络来识别有用的特征。我们利用特征选择的结果来减少进化算法的搜索空间。新算法易于扩展,实验结果表明,该算法效率更高,产生的策略更好。

英文摘要:

Relationship-based access control (ReBAC) is a flexible and expressive framework that allows policies to be expressed in terms of chains of relationship between entities as well as attributes of entities. ReBAC policy mining algorithms have a potential to significantly reduce the cost of migration from legacy access control systems to ReBAC, by partially automating the development of a ReBAC policy. Existing ReBAC policy mining algorithms support a policy language with a limited set of operators; this limits their applicability. This paper presents a ReBAC policy mining algorithm designed to be both (1) easily extensible (to support additional policy language features) and (2) scalable. The algorithm is based on Bui et al.'s evolutionary algorithm for ReBAC policy mining algorithm. First, we simplify their algorithm, in order to make it easier to extend and provide a methodology that extends it to handle new policy language features. However, extending the policy language increases the search space of candidate policies explored by the evolutionary algorithm, thus causes longer running time and/or worse results. To address the problem, we enhance the algorithm with a feature selection phase. The enhancement utilizes a neural network to identify useful features. We use the result of feature selection to reduce the evolutionary algorithm's search space. The new algorithm is easy to extend and, as shown by our experiments, is more efficient and produces better policies.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑