计算机工程 ›› 2012, Vol. 38 ›› Issue (3): 110-112.doi: 10.3969/j.issn.1000-3428.2012.03.037

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

一种不含双线性对的可截取签名方案

曹素珍1,王彩芬1,陈小云2,吕浩音3   

  1. (1. 西北师范大学数学与信息科学学院,兰州 730070;2. 平凉市第一中学信息中心,甘肃 平凉 744000; 3. 陇东学院计算机与信息科学学院,甘肃 庆阳 745000)
  • 收稿日期:2011-07-11 出版日期:2012-02-05 发布日期:2012-02-05
  • 作者简介:曹素珍(1976-),女,讲师,主研方向:信息安全;王彩芬,教授、博士生导师;陈小云,一级教师;吕浩音,讲师
  • 基金项目:
    国家自然科学基金资助项目(61063041);教育部科学技术研究基金资助重点项目(208148);甘肃省教育厅基金资助重点项目(0801-01)

Content Extraction Signature Scheme Without Bilinear Pairings

CAO Su-zhen 1, WANG Cai-fen 1, CHEN Xiao-yun 2, LV Hao-yin 3   

  1. (1. College of Mathematics and Information Science, Northwest Normal University, Lanzhou 730070, China; 2. Information Center of Pingliang First Middle School, Pingliang 744000, China; 3. College of Computer and Information Science, Longdong University, Qingyang 745000, China)
  • Received:2011-07-11 Online:2012-02-05 Published:2012-02-05

摘要: 现有可截取签名方案需要计算双线性对,计算效率较低。针对该问题,基于无证书思想,提出一个不含双线性对的可截取签名方案。采用绑定技术,通过哈希函数将用户公钥绑定在部分私钥的生成算法及签名算法中,以降低公钥替换攻击的可能性。在随机预言机模型下证明方案效率较高,签名是不可伪造的。

关键词: 可截取签名, 离散对数问题, 双线性对, 哈希函数, 随机预言机模型

Abstract: For the existing content extraction signature scheme, because calculated bilinear pairings caused the problem of low efficiency, based on certificateless thinking, this paper proposes an efficient content extraction signature scheme without pairings. Scheme of binding techniques, use hash functions will the public key binding to the partial private key generates and signature algorithms, reduce the possibility of public key substitution attack, and in the random oracle model proved scheme is existentially unforgeable under adaptive chosen-message attacks assuming. Compared with known solutions, the efficiency is higher.

Key words: content extraction signature, Discrete Logarithm Problem(DLP), bilinear pairings, Hash function, random oracle model

中图分类号: