基于域的策略挖掘
Mining Domain-Based Policies
AI总结:
本文提出从访问日志挖掘基于域的策略,构建理论并给出最优构造算法,证明DBPM和DTEPM为NP完全,并设计MaxSAT编码进行实证评估。
摘要:
保护域是访问控制中最持久的概念之一。具有相同访问控制特性的实体被归入同一保护域,基于域的策略将访问权限分配给整个保护域。随着物联网(IoT)的出现,设备既扮演主体又扮演客体的角色。基于域的策略特别适合支持这种角色对称性。本文研究了从不完整的访问日志中挖掘基于域的策略。我们首先构建了基于域的策略理论,从而得到一个多项式时间算法,该算法从给定的访问控制矩阵中构造最优的基于域的策略。然后,我们证明了基于域的策略挖掘(DBPM)问题以及相关的域和类型强制策略挖掘(DTEPM)问题都是NP完全的。接下来,我们研究了使用MaxSAT求解器解决DBPM的实际问题。为此,我们设计了复杂的编码,并实证评估了它们的相对性能。因此,本文为未来DBPM的研究奠定了基础。
英文摘要:
Protection domains are one of the most enduring concepts in Access Control. Entities with identical access control characteristics are grouped under the same protection domain, and domain-based policies assign access privileges to the protection domain as a whole. With the advent of the Internet of Things (IoT), devices play the roles of both subjects and objects. Domain-based policies are particularly suited to support this symmetry of roles. This paper studies the mining of domain-based policies from incomplete access logs. We began by building a theory of domain-based policies, resulting in a polynomial-time algorithm that constructs the optimal domain-based policy out of a given access control matrix. We then showed that the problem of domain-based policy mining (DBPM) and the related problem of mining policies for domain and type enforcement (DTEPM) are both NP-complete. Next, we looked at the practical problem of using a MaxSAT solver to solve DBPM. We devised sophisticated encodings for this purpose, and empirically evaluated their relative performance. This paper thus lays the groundwork for future study of DBPM.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。