An efficient and provably secure id-based signature scheme with batch verifications

Yuh-Min Tseng, Tsu Yang Wu, Jui Di Wu

Research output: Contribution to journalArticle

28 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)3911-3922
Number of pages12
JournalInternational Journal of Innovative Computing, Information and Control
Volume5
Issue number11
Publication statusPublished - 2009 Nov 1

Fingerprint

Identity-based
Signature Scheme
Batch
Identity-based Signature
Public key
Attack
Bilinear Pairings
Random Oracle Model
Diffie-Hellman
Distributed Applications
Certificate
Elliptic Curves
Repair
Performance Analysis
Simplify
Signature

All Science Journal Classification (ASJC) codes

  • Software
  • Theoretical Computer Science
  • Information Systems
  • Computational Theory and Mathematics

Cite this

@article{fb2471acd7bf4eea8db1ea8209da92ba,
title = "An efficient and provably secure id-based signature scheme with batch verifications",
abstract = "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.",
author = "Yuh-Min Tseng and Wu, {Tsu Yang} and Wu, {Jui Di}",
year = "2009",
month = "11",
day = "1",
language = "English",
volume = "5",
pages = "3911--3922",
journal = "International Journal of Innovative Computing, Information and Control",
issn = "1349-4198",
publisher = "IJICIC Editorial Office",
number = "11",

}

An efficient and provably secure id-based signature scheme with batch verifications. / Tseng, Yuh-Min; Wu, Tsu Yang; Wu, Jui Di.

In: International Journal of Innovative Computing, Information and Control, Vol. 5, No. 11, 01.11.2009, p. 3911-3922.

Research output: Contribution to journalArticle

TY - JOUR

T1 - An efficient and provably secure id-based signature scheme with batch verifications

AU - Tseng, Yuh-Min

AU - Wu, Tsu Yang

AU - Wu, Jui Di

PY - 2009/11/1

Y1 - 2009/11/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=71149103376&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=71149103376&partnerID=8YFLogxK

M3 - Article

VL - 5

SP - 3911

EP - 3922

JO - International Journal of Innovative Computing, Information and Control

JF - International Journal of Innovative Computing, Information and Control

SN - 1349-4198

IS - 11

ER -