一种验证非否认协议的新方法ANewVerification-电子与信息学报.PDFVIP

第 29 卷第 10 期 电 子 与 信 息 学 报 Vol.29No.10 2007 年 10 月 Journal of Electronics Information Technology Oct. .2007 一种验证非否认协议的新方法 周 勇 朱梧槚 (南京航空航天大学信息科学与技术学院 南京 210016) 摘 要：为了描述非否认协议中的各种不确定因素，在Kailar 逻辑系统中引入了表示缺省信息的否定词，以及相 应的推理机制。提出了安全协议验证的新方法，主要特点是：可以直接对协议的动态运行过程进行推理；推理具有 非单调性；避免过多的理想化假设；可以分析含有多个子协议的非否认协议，以及协议的可追究性和公平性。文中 以一种基于离线TTP 方式的非否认协议为例，验证了该协议在运行一次时具有可追究性，但多次运行时存在攻击。 关键词：非否认协议；Kailar 逻辑；协议验证 中图分类号：TP309 文献标识码：A 文章编号：1009-5896(2007)10-2493-05 A New Verification Method for Non-repudiation Protocol Zhou Yong Zhu Wu-jia (College of Information Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, China) Abstract: For the description of the nondeterministic factors in the non-repudiation protocols, the Kailar logic system extended with the default negation and the corresponding reasoning mechanism is introduced. The extended system can be used to verify security protocols and it has several main characteristics. Firstly, the method can reason not only for the results but also for the dynamic procedure of the protocol run. Secondly, the reasoning is nonmonotonic. Thirdly, the ideal assumptions of the protocols can be reduced. Fourthly, the accountability and fairness of the security protocols with some sub-protocols can be analyzed. As an example, a non-repudiation protocol with offline TTP was verified. The protocol has accountability during one protocol run and gets the attack in the repeated runs. Key words: Non-repudiation protocol; Kailar logic; Protocol verification 1 引言