摘要

Compared with the traditional public key cryptosystem, identity-based cryptosystem can simplify the key management procedure from the view point of the efficiency and convenience. Most of identity-based signature schemes are secure in the random oracle model, but for which any implementation of the random oracle results in insecure schemes. For example, when random oracle is instantiated with concrete hash functions, the resulting scheme is nonrandom which may not be secure. This paper proposes an efficient and provably secure identity-based signature scheme. The scheme is existentially unforgeable against adaptive chosen message attacks under the computational Diffie-Hellman assumption in the standard model. Compared with the known identity-based scheme secure in the standard model, the scheme enjoys shorter signature length and less operation.

全文