Certificate-based Cryptosystem is the latest evolution of traditional public key cryptosystem, but most of existing certificate-based signature schemes were 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 was proved that the scheme was blind and existentially unforgeable against user forgery attack, CA forgery attack and public key replacing attack. Efficiency analysis showed 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.
