首页 | 官方网站   微博 | 高级检索  
     

加入时间因素的Needham-Schorder协议及其形式化分析
引用本文:赵华伟,李大兴.加入时间因素的Needham-Schorder协议及其形式化分析[J].计算机工程与应用,2005,41(36):108-110,134.
作者姓名:赵华伟  李大兴
作者单位:山东大学网络信息安全研究所,济南,250100
基金项目:国家973基础研究发展规划资助项目(编号:G1999035802)
摘    要:在安全数据的通讯中,数据发送和接收的非否认十分重要。文章在克服Needham-Schorder协议缺陷的基础上,提出了一种基于时间戳的改进方案,该方案有效地解决了可信中心的性能瓶颈问题,是一个更为实际的安全协议,此外通过对其进行形式化分析,证明了该协议可以抵抗参加协议各主体的否认攻击。

关 键 词:时间戳  BAN逻辑  非否认
文章编号:1002-8331-(2005)36-0108-03
收稿时间:2005-07
修稿时间:2005-07

A Needham-Schorder Protocol Having Time Factor and its Formal Analysis
Zhao Huawei,Li Daxing.A Needham-Schorder Protocol Having Time Factor and its Formal Analysis[J].Computer Engineering and Applications,2005,41(36):108-110,134.
Authors:Zhao Huawei  Li Daxing
Affiliation:Institute of Network Security, Shandong University, Jinan 250100
Abstract:Data's non-repudiation is very important in the secure communication.This paper proposes a modified protocol based time-stamp to overcome the limitation of the Needham-Schorder protocol.It effectively solves the bottleneck problem of the CA,and fits the actual environment more than original Needham-Schorder protocol.In addition,we use the belif logic to analysis the protocol,and prove it can resist the non-repudiation attack of the principals who take part in the protocol.
Keywords:time-stamp  BAN Logic  non-repudiation
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号