路径条件和主体匹配:一种新的访问控制方法
Path Conditions and Principal Matching: A New Approach to Access Control
摘要:
传统的授权策略是以用户为中心的,也就是说,授权最终是根据用户身份来定义的。我们认为这种以用户为中心的方法不适合于许多应用程序,并且应该确定系统中实体之间存在的关系。虽然最近的研究已经考虑了指定的授权策略的基础上存在于社交网络中的对等体之间的关系的可能性,我们不知道这些想法的应用程序的一般计算系统。我们开发了一个正式的访问控制模型,利用基于关系的访问控制的思想和两个阶段的方法来评估政策。我们的策略是使用路径条件定义的,这与正则表达式类似。我们定义语义的路径条件,我们用它来开发一个严格的方法来评估政策。我们描述的算法需要评估政策,并建立其复杂性。最后,我们用一个例子来说明我们的模型的优点,并描述了我们的算法的初步实现。
英文摘要:
Traditional authorization policies are user-centric, in the sense that authorization is defined, ultimately, in terms of user identities. We believe that this user-centric approach is inappropriate for many applications, and that what should determine authorization is the relationships that exist between entities in the system. While recent research has considered the possibility of specifying authorization policies based on the relationships that exist between peers in social networks, we are not aware of the application of these ideas to general computing systems. We develop a formal access control model that makes use of ideas from relationship-based access control and a two-stage method for evaluating policies. Our policies are defined using path conditions, which are similar to regular expressions. We define semantics for path conditions, which we use to develop a rigorous method for evaluating policies. We describe the algorithm required to evaluate policies and establish its complexity. Finally, we illustrate the advantages of our model using an example and describe a preliminary implementation of our algorithm.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。