针对高效的基于证书数字签名的构造问题,基于CDH困难性假设,构造了一个基于证书的短签名方案,并在随机预言机模型下证明了其安全性.通过与已有可证明安全的基于证书签名方案进行比较,所构造的签名方案在效率上和长度上都是最优的.
Aiming at the construction problems of the efficient certificate-based signature scheme, based on the computational Diffie-Hellman assumption, an efficient short Certificate-Base signature scheme is proposed with provable security under the random oracle model. Moreover, compared with the available provable security certificate-based signature schemes, this scheme is optimal about the efficiency and the length of signature.