A secure signature scheme with providing variant batch verifications extremely improves the verification performance for many cooperative and distributed applications. The identity (ID)-based public key system can simplify certificate management as compared to certificated-based public key systems. With the advent of the ID-based public key system using bilinear pairings defined on elliptic curves, many ID-based signature schemes have been proposed. Recently, Cha and Cheon proposed a new ID-based signature scheme which is more efficient than the previously proposed schemes, but their scheme does not offer batch verifications for multiple signatures because their scheme suffers from forgery attacks for batch verifications. To repair this drawback, Yoon et al. proposed a secure ID-based signature scheme with batch verifications. However, Yoon et al. 's scheme requires more computational time than Cha and Cheon's scheme. In this paper, we propose an efficient and provably secure ID-based signature scheme supporting variant kinds of batch verifications. In the random oracle model and under the computational Diffie-Hellman assumption, we show that our scheme is secure against existential forgery attacks under various kinds of batch verifications. According to performance analysis, our scheme with batch verifications has the best performance as compared to the previously proposed schemes.
|Number of pages||12|
|Journal||International Journal of Innovative Computing, Information and Control|
|Publication status||Published - 2009 Nov 1|
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Information Systems
- Computational Theory and Mathematics