检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]沈阳航空工业学院计算机学院,沈阳110136
出 处:《计算机工程》2009年第18期148-150,153,共4页Computer Engineering
摘 要:在现行PKI信任模型的证书路径构造方案中,层次模型证书路径构造对根节点安全性依赖过高,而网状模型路径构造时存在回路。针对上述问题,提出一种新的依赖图信任模型,证明依赖图节点之间有多条路径且没有回路,给出新模型下的证书路径构造方法。实验结果表明,新模型的证书路径构造效率等同于层次模型,安全性与网状模型相近。In the current certificate path building schemes of PKI trust model, the following defects exist that the hierarchical model certificate path building has heavy dependence on the security of root node, and the mesh model path building can generate loops. In order to solve the above problems, a new depender graph trust model is proposed which is verified there are many paths between depender graph nodes but no loops, and certificate path building method in the new model is put forward. Experimental results show that the efficiency of the certificate path building of new model is equivalent to that of the hierarchical model, and has similar security comparing to the mesh model.
分 类 号:TP309[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222