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

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

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

中图分类号: 

• TP309