检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]常熟理工学院计算机科学与工程系,江苏常熟215500
出 处:《计算机技术与发展》2007年第8期155-157,共3页Computer Technology and Development
基 金:江苏省高校自然科学研究计划资助项目(03KJD51002)
摘 要:PKI中存在多个可信任点和无终止的可信任环的可能性,使证书认证路径的有效发现复杂和耗时,路径构造的任务非常繁重。提出的基于路径代理的桥信任模型利用路径代理服务器,采用生成树算法提前进行路径构造存储,从而将复杂的路径构造问题转化为路径查询问题,实现了对PKI桥信任模型的优化。In PKI technique,by making use of CA certification can availably avoid active attack. In each CA certification area can build hierarehieal models or network models,then by traditional bridge trust model can also reach intercommunication arnong different areas, so that CA and entities can trust each other. But in PKI, perhaps exist more than one trusted dits or an endless circle, thus discovery an certification's path is beconfing very complex and time - consuming,so the task that build the path will be an overwork. In the paper by using a path agent server in path agent bridge trust model,by adopting spanning tree algorithm built and store the path ahead of schedule,thus the complex task that build the path is converted into a task that search paths,therefore realize the optimization of the bridge trust model in PKI.
分 类 号:TP393.08[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.30