计算机工程 ›› 2013, Vol. 39 ›› Issue (4): 132-136.doi: 10.3969/j.issn.1000-3428.2013.04.031

• 安全技术 • 上一篇    下一篇

基于离散对数问题的可截取签名方案

曹素珍,王彩芬   

  1. (西北师范大学计算机科学与工程学院,兰州 730070)
  • 收稿日期:2012-02-21 出版日期:2013-04-15 发布日期:2013-04-12
  • 作者简介:曹素珍(1976-),女,讲师,主研方向:密码学,信息安全;王彩芬,教授、博士生导师
  • 基金项目:
    国家自然科学基金资助项目(61063041, 61163038, 61202395)

Content Extraction Signature Scheme Based on DLP

CAO Su-zhen, WANG Cai-fen   

  1. (College of Computer Science and Engineering, Northwest Normal University, Lanzhou 730070, China)
  • Received:2012-02-21 Online:2013-04-15 Published:2013-04-12

摘要: 在朱辉等提出的无证书签密方案(计算机研究与发展,2010年第9期)基础上,提出一种满足强安全性、无需双线性对运算的可截取签名方案。通过将用户公钥绑定在部分私钥的生成算法及签名算法中,降低公钥替换攻击的威胁,利用安全哈希函数的不可碰撞性,使方案能抵抗适应性选择消息的存在性伪造攻击,并在随机预言模型下基于离散对数难题给出安全性证明。与同类方案相比,该方案的签名及可截取算法减少了一个指数运算,计算效率有所提高。

关键词: 可截取签名, 离散对数问题, 无证书, 随机预言模型, 适应性选择消息攻击, 存在性伪造

Abstract: According to the certificateless signcryption scheme proposed by Zhu Hui et al, this paper proposes a strongly secure Content Extraction Signature(CES) scheme without bilinear operations. The user’s public key is bound to the partial private key generation algorithm and signature algorithm, which reduces the possibility of user’s public key substitution attack. By using secure hash function of a non-collision, it can resist existence unforgeable under adaptive chosen-message attacks. Based on Discrete Logarithm Problem(DLP) is intractable, and its security is proved under Random Oracle Model(ROM). Compared with similar programs, the scheme’s signature and interception algorithm reduces one exponentiation computation, the computational efficiency is improved.

Key words: Content Extraction Signature(CES), Discrete Logarithm Problem(DLP), certificateless, Random Oracle Model (ROM), adaptability chosen-message attack, existential forgery

中图分类号: