关系、路径和主体匹配:一种新的访问控制方法
Relationships, Paths and Principal Matching: A New Approach to Access Control
摘要:
最近的工作基于关系的访问控制已经开始显示它如何可以应用到一般的计算系统,而不是简单地被用于社交网络应用程序。使用关系来确定授权策略可以定义比仅基于常用的角色成员关系概念的策略更强大的策略。这里描述的关系、路径和主体匹配(RPPM)模型是一个使用关系和两阶段请求评估过程的正式访问控制模型。我们使用路径条件,这是类似于正则表达式,定义策略。然后,我们采用非确定性有限自动机来确定哪些政策适用于请求。RPPM模型的强大功能和健壮性使我们能够在授权过程中包含上下文信息(通过包含逻辑实体),并使我们能够支持理想的策略基础,例如职责分离和中国墙。此外,RPPM模型自然支持缓存机制,这对请求评估性能有很大影响。
英文摘要:
Recent work on relationship-based access control has begun to show how it can be applied to general computing systems, as opposed to simply being employed for social networking applications. The use of relationships to determine authorization policies enables more powerful policies to be defined than those based solely on the commonly used concept of role membership. The relationships, paths and principal matching (RPPM) model described here is a formal access control model using relationships and a two-stage request evaluation process. We make use of path conditions, which are similar to regular expressions, to define policies. We then employ non-deterministic finite automata to determine which policies are applicable to a request. The power and robustness of the RPPM model allows us to include contextual information in the authorization process (through the inclusion of logical entities) and allows us to support desirable policy foundations such as separation of duty and Chinese Wall. Additionally, the RPPM model naturally supports a caching mechanism which has significant impact on request evaluation performance.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。