论文部分内容阅读
用标准的Datalog程序表示信任管理系统SPKI/SDSI2.0的系统状态,以Datalog程序的最小Herbrand模型作为它的语义,定义了信任管理系统SPKI/SDSI2.0的安全分析模型,制定了状态转换的限制规则,该限制规则是可实现的,在此基础上对SPKI/SDSI2.0的权限泄露问题进行了全面的分析,证明了该问题是在多项式时间内可判定的;证明了一个状态对于权限r是否可靠依赖且仅依赖于关于权限r的可信主体集合,并给出了计算可信主体集合的算法.
The standard Datalog program is used to represent the system state of the trust management system SPKI / SDSI2.0. With the minimum Herbrand model of Datalog program as its semantics, the security analysis model of SPKI / SDSI2.0 is defined, and the state transition The rules of limitation are feasible. On this basis, a comprehensive analysis of the SPKI / SDSI 2.0 privilege disclosure problem is given, which proves that the problem is determinable in polynomial time. It proves that a state has no influence on the privilege Whether r depends reliably and depends only on the set of trusted subjects for the authority r and gives an algorithm to calculate the set of trusted subjects.