欢迎访问中国科学院大学学报,今天是

中国科学院大学学报 ›› 2013, Vol. 30 ›› Issue (5): 699-705.DOI: 10.7523/j.issn.2095-6134.2013.05.020

• 计算机科学 • 上一篇    下一篇

一种基于项重写的密码模块API安全性检测算法

刘波1,2, 陈华1   

  1. 1. 中国科学院软件研究所, 北京 100080;
    2. 中国科学院大学, 北京 100049
  • 收稿日期:2012-11-01 修回日期:2012-12-24 发布日期:2013-09-15
  • 基金资助:
    国家自然科学基金(91118006)资助 

A security analysis algorithm for cryptographic module API using term rewriting system

LIU Bo1,2, CHEN Hua1   

  1. 1. Institute of Software, Chinese Academy of Sciences, Beijing 100080, China;
    2. University of Chinese Academy of Sciences, Beijing 100049, China
  • Received:2012-11-01 Revised:2012-12-24 Published:2013-09-15
  • Contact: 刘波,E-mail:liubo@is.iscas.ac.cn

摘要: 针对密码模块API的形式化验证,提出一种基于项重写形式化模型的检测算法. 该算法利用符号化及广度优先搜索方法,使用项重写规则对敌手的初始知识集不断进行匹配和扩展,直到找到攻击路径或者搜索完状态空间. 以密码模块API标准PKCS#11为例具体实现了该检测算法,通过5个实验完成了对PKCS#11对称密钥管理部分API的形式化验证. 实验结果表明,该方法能有效检测针对PKCS#11的攻击,并找到一个新的攻击序列.

关键词: PKCS#11, 模型检测, 项重写, 广度优先搜索

Abstract: For the formal verification of the cryptographic module API, a security analysis algorithm using term rewriting system was proposed. The term rewriting rules were used to extend the intruder's knowledge with breadth-first search and symbolic method. The search will stop until an attack path has been found or all the finite state space has been searched. The algorithm was applied to PKCS#11 which is an API standard for the cryptographic module, and five experiments were performed to complete the formal verification of the symmetric key management API commands of PKCS#11. The experimental results showed that the algorithm detected the attacks against PKCS#11 precisely and effectively, and also a new API attack sequence was discovered.

Key words: PKCS#11, model checking, term rewriting, breadth-first search

中图分类号: