期刊文献+

一种验证非否认协议的新方法 被引量:2

A New Verification Method for Non-repudiation Protocol
下载PDF
导出
摘要 为了描述非否认协议中的各种不确定因素,在Kailar逻辑系统中引入了表示缺省信息的否定词,以及相应的推理机制。提出了安全协议验证的新方法,主要特点是:可以直接对协议的动态运行过程进行推理;推理具有非单调性;避免过多的理想化假设;可以分析含有多个子协议的非否认协议,以及协议的可追究性和公平性。文中以一种基于离线TTP方式的非否认协议为例,验证了该协议在运行一次时具有可追究性,但多次运行时存在攻击。 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 offiine TTP was verified. The protocol has accountability during one protocol run and gets the attack in the repeated runs.
作者 周勇 朱梧槚
出处 《电子与信息学报》 EI CSCD 北大核心 2007年第10期2493-2497,共5页 Journal of Electronics & Information Technology
基金 国家自然科学基金(60573070)资助课题
关键词 非否认协议 KAILAR逻辑 协议验证 Non-repudiation protocol Kailar logic Protocol verification
  • 相关文献

参考文献3

二级参考文献4

  • 1沈延生.对村民自治的期望与批评[A]..中国农村研究(2002年卷)[C].北京:中国社会科学出版社,2003..
  • 2Zhou J,Proc ’96 IEEE Sympo Security and Privacy,1996年,55页
  • 3Deng R H,J Network System Management,1996年,4卷,3期,279页
  • 4周典萃,卿斯汉,周展飞.Kailar逻辑的缺陷[J].软件学报,1999,10(12):1238-1245. 被引量:29

共引文献59

同被引文献22

  • 1Xie Xiao-yao 1,2 , Zhang Huan-guo 1 1. School of Computer, Wuhan University, Wuhan 430072, Hubei, China,2. Institute of Network Technology, Guizhou University of Technology, Guiyang 550003, Guizhou, China.Accountability Analysis of Electronic Commerce Protocols by Finite Automaton Model[J].Wuhan University Journal of Natural Sciences,2004,9(3):293-295. 被引量:2
  • 2卿斯汉.一种电子商务协议形式化分析方法[J].软件学报,2005,16(10):1757-1765. 被引量:23
  • 3文静华,田建强,李祥.一个新的公平非否认协议[J].计算机工程,2006,32(2):132-134. 被引量:4
  • 4文静华,李祥,张焕国,梁敏,张梅.基于ATL的公平电子商务协议形式化分析[J].电子与信息学报,2007,29(4):901-905. 被引量:7
  • 5ARMANDO A, CARBONE R, COMPAGNA L. LTL model checking for security protocols [A]. 20th IEEE Computer Security Foundations Symposium[C]. 2007. 385-396.
  • 6KLAY F, VIGNERON L. Automatic methods for analyzing non-repudiation protocols with an active intruder[A]. Formal Aspects in Security and Trust[C]. 2009. 192-209.
  • 7BELLA G, PAULSON L C. Accountability protocols: formalized and verified [J]. ACM Transaction on Information System Security. 2006, 9(2):138-161.
  • 8KUN W, JAMES H. A theorem-proving approach to verification of fair non-repudiation protocols[A]. 4th International Workshop on Formal Aspects in Security and Trust[C]. 2007. 202-219.
  • 9CORTIER V, WARINSCHI B, Computationally sound, automated proofs for security protocols[A]. Programming Languages and Sys- tems[C]. 2005. 157-171.
  • 10JANVIER R, LAKHNECH Y, MAZAREL. Completing the picture: soundness of formal encryption in the presence of active adversaries[A]. Programming Languages and Systems[C]. 2005. 172-185.

引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部