关键词: 基于证书签名, 双线性对, 随机预言机模型, 整数分解问题, 安全性

Abstract: The known Certificate-Based Signature（CBS） schemes are designed under bilinear pairing, however, as is known to all, the computation of bilinear pairing is most difficult. In order to improve the efficiency of certificate-based signature scheme, based on the Integer Factorization Problem（IFP）, a new efficient certificate-based signature scheme is proposed. Certificate generation algorithm and signature generation algorithm of the scheme are designed by using the Jacobi symbol, the Hash value of user information and message to be signed are mapped into quadratic residue by this way. Certificate and signature’s unforgery are under the difficult problem of modulo Blum integer square root. The new scheme security is proved under the Random Oracle Model（ROM） and the scheme does not need any bilinear pairing computation, just needs compute Jacobi symbol and power exponentiation, so it is very efficient.

Key words: certificate-based signature, bilinear pairing;random oracle mode, integer factorization problem, security