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 language | English |
|---|---|
| Title of host publication | Proceedings - International Conference on Availability, Reliability and Security, ARES 2009 |
| Pages | 935-940 |
| Number of pages | 6 |
| DOIs | |
| Publication status | Published - 2009 Oct 12 |
| Event | International Conference on Availability, Reliability and Security, ARES 2009 - Fukuoka, Fukuoka Prefecture, Japan Duration: 2009 Mar 16 → 2009 Mar 19 |
Publication series
| Name | Proceedings - International Conference on Availability, Reliability and Security, ARES 2009 |
|---|
Other
| Other | International Conference on Availability, Reliability and Security, ARES 2009 |
|---|---|
| Country | Japan |
| City | Fukuoka, Fukuoka Prefecture |
| Period | 09-03-16 → 09-03-19 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Software
- Safety, Risk, Reliability and Quality
Cite this
}
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 (Proceedings - International Conference on Availability, Reliability and Security, ARES 2009).Research output: Chapter in Book/Report/Conference proceeding › Conference 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
AN - SCOPUS:70349706045
SN - 9780769535647
T3 - Proceedings - International Conference on Availability, Reliability and Security, ARES 2009
SP - 935
EP - 940
BT - Proceedings - International Conference on Availability, Reliability and Security, ARES 2009
ER -