Towards efficient ID-based signature schemes with batch verifications from bilinear pairings

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)

Abstract

Many group-oriented applications and multicast communications often need to verify which group members have sent/received a message. However, individual verification of signed messages would require a significant computation cost. A secure signature scheme with supporting variant batch verifications extremely improves performance. In 2003, Cha and Cheon proposed an efficient identity (ID)- based signature scheme with bilinear pairings. Recently, Yoon et al. pointed out that their scheme does not provide batch verifications for multiple signatures. In this paper, we examine and discuss twelve kinds of Cha-Cheon like signature schemes and security properties. We obtain an efficient ID-based signature scheme supporting batch verifications. In the random oracle model and under the computational Diffie-Hellman assumption, we show that this new scheme is secure against existential forgery attacks under various types of batch verifications.

Original languageEnglish
Title of host publicationProceedings - International Conference on Availability, Reliability and Security, ARES 2009
Pages935-940
Number of pages6
DOIs
Publication statusPublished - 2009 Oct 12
EventInternational Conference on Availability, Reliability and Security, ARES 2009 - Fukuoka, Fukuoka Prefecture, Japan
Duration: 2009 Mar 162009 Mar 19

Other

OtherInternational Conference on Availability, Reliability and Security, ARES 2009
CountryJapan
CityFukuoka, Fukuoka Prefecture
Period09-03-1609-03-19

Fingerprint

Communication
Costs

All Science Journal Classification (ASJC) codes

  • Software
  • Safety, Risk, Reliability and Quality

Cite this

Tseng, Y-M., Wu, T. Y., & Wu, J. D. (2009). Towards efficient ID-based signature schemes with batch verifications from bilinear pairings. In Proceedings - International Conference on Availability, Reliability and Security, ARES 2009 (pp. 935-940). [5066590] https://doi.org/10.1109/ARES.2009.10
Tseng, Yuh-Min ; Wu, Tsu Yang ; Wu, Jui Di. / Towards efficient ID-based signature schemes with batch verifications from bilinear pairings. Proceedings - International Conference on Availability, Reliability and Security, ARES 2009. 2009. pp. 935-940
@inproceedings{925bd6acc6f54844833c2b58d508e059,
title = "Towards efficient ID-based signature schemes with batch verifications from bilinear pairings",
abstract = "Many group-oriented applications and multicast communications often need to verify which group members have sent/received a message. However, individual verification of signed messages would require a significant computation cost. A secure signature scheme with supporting variant batch verifications extremely improves performance. In 2003, Cha and Cheon proposed an efficient identity (ID)- based signature scheme with bilinear pairings. Recently, Yoon et al. pointed out that their scheme does not provide batch verifications for multiple signatures. In this paper, we examine and discuss twelve kinds of Cha-Cheon like signature schemes and security properties. We obtain an efficient ID-based signature scheme supporting batch verifications. In the random oracle model and under the computational Diffie-Hellman assumption, we show that this new scheme is secure against existential forgery attacks under various types of batch verifications.",
author = "Yuh-Min Tseng and Wu, {Tsu Yang} and Wu, {Jui Di}",
year = "2009",
month = "10",
day = "12",
doi = "10.1109/ARES.2009.10",
language = "English",
isbn = "9780769535647",
pages = "935--940",
booktitle = "Proceedings - International Conference on Availability, Reliability and Security, ARES 2009",

}

Tseng, Y-M, Wu, TY & Wu, JD 2009, Towards efficient ID-based signature schemes with batch verifications from bilinear pairings. in Proceedings - International Conference on Availability, Reliability and Security, ARES 2009., 5066590, pp. 935-940, International Conference on Availability, Reliability and Security, ARES 2009, Fukuoka, Fukuoka Prefecture, Japan, 09-03-16. https://doi.org/10.1109/ARES.2009.10

Towards efficient ID-based signature schemes with batch verifications from bilinear pairings. / Tseng, Yuh-Min; Wu, Tsu Yang; Wu, Jui Di.

Proceedings - International Conference on Availability, Reliability and Security, ARES 2009. 2009. p. 935-940 5066590.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Towards efficient ID-based signature schemes with batch verifications from bilinear pairings

AU - Tseng, Yuh-Min

AU - Wu, Tsu Yang

AU - Wu, Jui Di

PY - 2009/10/12

Y1 - 2009/10/12

N2 - Many group-oriented applications and multicast communications often need to verify which group members have sent/received a message. However, individual verification of signed messages would require a significant computation cost. A secure signature scheme with supporting variant batch verifications extremely improves performance. In 2003, Cha and Cheon proposed an efficient identity (ID)- based signature scheme with bilinear pairings. Recently, Yoon et al. pointed out that their scheme does not provide batch verifications for multiple signatures. In this paper, we examine and discuss twelve kinds of Cha-Cheon like signature schemes and security properties. We obtain an efficient ID-based signature scheme supporting batch verifications. In the random oracle model and under the computational Diffie-Hellman assumption, we show that this new scheme is secure against existential forgery attacks under various types of batch verifications.

AB - Many group-oriented applications and multicast communications often need to verify which group members have sent/received a message. However, individual verification of signed messages would require a significant computation cost. A secure signature scheme with supporting variant batch verifications extremely improves performance. In 2003, Cha and Cheon proposed an efficient identity (ID)- based signature scheme with bilinear pairings. Recently, Yoon et al. pointed out that their scheme does not provide batch verifications for multiple signatures. In this paper, we examine and discuss twelve kinds of Cha-Cheon like signature schemes and security properties. We obtain an efficient ID-based signature scheme supporting batch verifications. In the random oracle model and under the computational Diffie-Hellman assumption, we show that this new scheme is secure against existential forgery attacks under various types of batch verifications.

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

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

U2 - 10.1109/ARES.2009.10

DO - 10.1109/ARES.2009.10

M3 - Conference contribution

SN - 9780769535647

SP - 935

EP - 940

BT - Proceedings - International Conference on Availability, Reliability and Security, ARES 2009

ER -

Tseng Y-M, Wu TY, Wu JD. Towards efficient ID-based signature schemes with batch verifications from bilinear pairings. In Proceedings - International Conference on Availability, Reliability and Security, ARES 2009. 2009. p. 935-940. 5066590 https://doi.org/10.1109/ARES.2009.10