摘要
委托授权具有动态性和细粒度授权等特性,解决了分布式授权的可扩展性问题。提出用带权有向图描述委托授权模型,并给出了形式化描述,设计了一种有向图的最小生成出树算法,解决了授权深度、环状授权和冲突授权等关键问题。
Delegable authorization has the characteristics of dynamics and fine granularity, and it resolves the extensibility of authorization in distributed environment. A proposal is presented to describe delegable authorization models by weighted directed graphs, and the formal description is given. An algorithm of minimum spanning tree of weighted directed graphs is designed to resolve authorization depth, conflict and cyclic authorization in delegable model.
出处
《计算机应用与软件》
CSCD
北大核心
2007年第11期47-49,共3页
Computer Applications and Software
基金
湖南省教育厅项目(05C740)
关键词
委托授权
有向图
最小生成树
访问控制
Delegable authorization
Directed graph
Minimum spanning tree
Access control
作者简介
陈旭日，博士生，主研领域：网格计算，网络安全。
