具有强安全性不含双线性对的基于证书盲签名

基于证书密码体制是传统公钥密码体制的最新演进,但现有基于证书签名方案大都采用双线性对构造,计算效率较低.为了解决这个问题,基于离散对数难题,提出1种不含双线性映射的基于证书盲签名方案.方案以有限域上模幂运算为主构造,避免了复杂的对运算,用二元仿射变换盲化消息,计算量小、效率高.每次验证签名前用验证方程检验证书及公钥的真实性,实现了2者之间的相互认证.方案在随机预言机模型下证明能够抵抗用户伪造攻击、认证中心伪造攻击和公钥替换攻击,并具有强盲性.分析表明,与同类方案相比,本方案具有签名长度短,计算量和通信量小的优势,特别适用于计算能力和带宽受限的领域.

Strongly Secure Certificate-based Blind Signature Scheme Without Pairings

Certificate-Based Cryptosystem is the latest evolution of traditional Public Key Cryptosystem, but most of existing certificate-based signature schemes was constructed by pairings, which led to low calculation efficiency. Based on discrete logarithm problem, a certificate-based blind signature scheme without pairings was presented. The new scheme had higher efficiency, as it was mainly based on modular exponentiation arithmetic in the finite field instead of pairings and messages were blinded by affine transformation. The validities of public key and certificate were verified before verifying signature, so the mutual authentication of both public key and certificate was achieved. Under the random oracle model, it had been proved that the scheme was blind and existentially unforgeable against user forgery attack, CA forgery attack and public key replacing attack. Efficiency analysis shows that, compared with other similar schemes, the proposed scheme had shorter signature length, smaller computation and communication complexity, so it was suitable for application fields of lower computing power and limited bandwidth.