[1]常晋义 李明杰.PKI中桥信任模型的优化[J].计算机技术与发展,2007,(08):155-157.
　CHANG Jin-yi,LI Ming-jie.Optimization of Bridge Trust Model in PKI[J].,2007,(08):155-157.
点击复制

PKI中桥信任模型的优化()
分享到：

《计算机技术与发展》[ISSN:1006-6977/CN:61-1281/TN]

卷:
期数:
2007年08期
页码:
155-157
栏目:
安全与防范
出版日期:
1900-01-01

文章信息/Info

Title:
Optimization of Bridge Trust Model in PKI
文章编号:
1673-629X（2007）08-0155-03
作者:
常晋义 李明杰
常熟理工学院计算机科学与工程系
Author(s):
CHANG Jin-yi;  LI Ming-jie
Department of Computer Science ＆ Engineering, Changshu Institute of Technology
关键词:
生成树算法; 桥信任模型; 路径代理服务器; PKI
Keywords:
spanning tree algorithm;  bridge trust model;  path agent server;  PKI
分类号:
TP393.08
文献标志码:
A
摘要:
PKI中存在多个可信任点和无终止的可信任环的可能性,使证书认证路径的有效发现复杂和耗时,路径构造的任务非常繁重。提出的基于路径代理的桥信任模型利用路径代理服务器,采用生成树算法提前进行路径构造存储,从而将复杂的路径构造问题转化为路径查询问题,实现了对PKI桥信任模型的优化
Abstract:
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

相似文献/References:

[1]刘海华 王萍萍.基于生成树算法的链路层拓扑发现研究[J].计算机技术与发展,2008,(05):101.
　LIU Hai-hua,WANG Ping-ping.Research of Datalink Layer Topology Discovery Based on Spanning Tree Algorithm[J].,2008,(08):101.

备注/Memo

备注/Memo:
江苏省高校自然科学研究计划资助项目（03KJD51002）常晋义（1955-），男，山西忻州人，教授，研究方向为空间决策支持系统、信息系统安全
更新日期/Last Update: 1900-01-01