期刊文献+

基于Spin的安全协议形式化验证技术 被引量:4

Formal verification technologis of security protocol based on Spin
下载PDF
导出
摘要 针对安全协议的形式化验证问题,运用模型检测方法,以一种改进的入侵者Promela语义模型,对双方密钥分配中心协议进行Spin模型检测,验证发现其不满足线性时序逻辑(LTL)公式描述的安全性,得到了原协议的安全漏洞。针对该漏洞,提出了一种协议改进方案,并针对改进后的协议,给出新的Promela语义模型的建模方法。改进的入侵者模型建模方法比起原方法:模型检测过程中的存储状态数减少,使模型复杂度降低约40%;迁移状态数减少,使验证效率提升约44%。 Aiming at the formal verification problem in security protocols, an improved Promela semantic intruder model was used to complete the model checking for key distribution center protocol, to find that it does't meet the security property described by LTL( Linear Temporal Logic) formula, and to get a protocol vulnerability. An improvement program against vulnerability was proposed. A new Promela semantic modeling was put forward for the improved protocol. The improved intruder modeling method reduces the number of states stored in the model checking, thus the model complexity reduces about40%; and reduces the number of transiations, thus the verification efficiency increases about 44%.
出处 《计算机应用》 CSCD 北大核心 2014年第A02期85-90,共6页 journal of Computer Applications
基金 国家自然科学基金资助项目(11371003) 广西自然科学基金资助项目(2011GXNSFA018154 2012GXNSFGA060003) 广西区主席科技资金资助项目(10169-1) 广西教育厅科研资助项目(201012MS274)
关键词 安全协议 形式化验证 Spin模型检测 Promela语义模型 LTL公式 密钥分配中心协议 security protocol formal verification Spin model checking Promela semantic model Linear Timing Logic(LTL) formula key contribution center protocol
  • 相关文献

参考文献15

  • 1NEEDHAM R, SCHROEDER M. Using encryption for authentica- tion in large networks of computers[ J]. Communications of the ACM, 1978, 21(12) : 993 -999.
  • 2LOWE G. An attack on the Needham-Schroeder public-key authen- tication protocol [J]. Information Processing Letters, 1995, 56:131 -133.
  • 3BURROWS M, ABADI M, NEEDHAM R M. A logic of authentica- tion[ J].Proceedings of the Royal Society of London. A. Mathemati- cal and Physical Sciences, 1989, 426( 1871): 233 -271.
  • 4GONG L, NEEDHAM R, YAHALOM R. Reasoning about belief in eryptographie protocols[ C]// Proceedings of the 1990 IEEE Com- puter Society Symposium on Research in Security and Privacy. Pis- caraway: IEEE, 1990:234-248.
  • 5MAO W, BOYD C. Towards formal analysis of security protocols [ C]// Proceedings of the 1993 IEEE Computer Security Founda- tions Workshop VI. Piscataway: IEEE, 1993: 147- 158.
  • 6ABADI M, TUTYLE M R. A semantics for a logic of authentication [ C]//Proceedings of the Tenth Annum ACM Symposium on Princi- ples of Distributed Computing. New York: ACM, 1991:201 -216.
  • 7van OORSCHOT P. Extending cryptographic logics of belief to key agreement protocols[ C]// Proceedings of the 1st ACM Conference on Computer and Communications Security. New York: ACM, 1993:232-243.
  • 8SYVERSON P F, van OORSCHOT P C. On unifying some erypto- graphic protocol logics[ C]// Proceedings of the 1994 IEEE Com- puter Society Symposium on Research in Security and Privacy. Pis- cataway: IEEE, 1994: 14-28.
  • 9CHEN H, CLARK J A, JOCOB J L. A search-based approach to the automated design of security protocols, YCS 376[ R]. New York: University of York, Department of Computer Science, 2004.
  • 10LOWE G. Towards a completeness result for model checking of se- curity protocols[J]. Journal of Computer Security, 1999, 7(2) : 89 - 146.

同被引文献30

  • 1龙士工,王巧丽,李祥.密码协议的Promela语言建模及分析[J].计算机应用,2005,25(7):1548-1550. 被引量:11
  • 2薛锐,冯登国.安全协议的形式化分析技术与方法[J].计算机学报,2006,29(1):1-20. 被引量:60
  • 3吴尽昭.多值逻辑定理机器证明的代数方法[J].计算机学报,1996,19(10):773-779. 被引量:5
  • 4Dolev D, Yao A. On the security of public key protocols[J]. IEEE Transactions on Information Theory, 1983,29(2): 198 - 208.
  • 5Fu Yulong, Ousmane K. A finite transition model for security protocol verification[ C ]//Proc of 6th International Conference on Security of Information and Networks. Aksaray, Turkey,2013.
  • 6Kanovich M, Kiriginc T B, Nigamd Vi,et al. Bounded memory Dolev-Yao adversaries in collaborative systems [ J ]. Infor- mation and Computation, 2014, 238:233 -261.
  • 7Mazare L. Satisfiability of Dolev-Yao constraints [ J]. Electronic Notes in Theoretical Computer Science,2005,125 (1): 109 -124.
  • 8Otway D, Rees O. Efficient and timely mutual authentication[J]. ACM Operating Systems Review, 1987,21 (1) :8 -10.
  • 9Abadi M, Needham R. Prudent engineering practice for cryptographic protocols [ J ]. 1EEE Transactions on Software Engi- neering, 1996,22( 1 ) :6 - 15.
  • 10郭建,边明明,韩俊岗.LTL公式到自动机的转换[J].计算机科学,2008,35(7):241-243. 被引量:4

引证文献4

二级引证文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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