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

一种基于决策树学习的访问控制策略挖掘方法

A Decision Tree Learning Approach for Mining Relationship-Based Access Control Policies

Thang Bui, Scott D. Stoller

摘要:

基于规则的访问控制(ReBAC)提供了高水平的表现力和灵活性,通过允许以实体之间的关系链来表达策略,从而促进安全性和信息共享。ReBAC策略挖掘算法有可能通过部分自动化ReBAC策略的开发来显著降低从传统访问控制系统迁移到ReBAC的成本。提出了一种基于决策树的新算法DTRM(决策树ReBAC Miner)和DTRM $^-$,用于从访问控制列表和实体信息中挖掘ReBAC策略。与最先进的ReBAC挖掘算法相比,我们的算法明显更快,实现了相当的策略质量,并且可以用更丰富的语言挖掘策略。

英文摘要:

Relationship-based access control (ReBAC) provides a high level of expressiveness and flexibility that promotes security and information sharing, by allowing policies to be expressed in terms of chains of relationships between entities. ReBAC policy mining algorithms have the potential to significantly reduce the cost of migration from legacy access control systems to ReBAC, by partially automating the development of a ReBAC policy. This paper presents new algorithms, called DTRM (Decision Tree ReBAC Miner) and DTRM$^-$, based on decision trees, for mining ReBAC policies from access control lists (ACLs) and information about entities. Compared to state-of-the-art ReBAC mining algorithms, our algorithms are significantly faster, achieve comparable policy quality, and can mine policies in a richer language.

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

↑