English  |  正體中文  |  简体中文  |  Items with full text/Total items : 6469/11641
Visitors : 19099107      Online Users : 294
RC Version 3.2 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Adv. Search
LoginUploadHelpAboutAdminister

Please use this identifier to cite or link to this item: http://ir.ncue.edu.tw/ir/handle/987654321/12209

Title: Towards Efficient ID-based Signature Schemes with Batch Verifications from Bilinear Pairings
Authors: Tseng, Yuh-Min;Wu, Tsu-Yang;Wu, Jui-Di
Contributors: 數學系
Date: 2009-03
Issue Date: 2012-07-03T03:46:49Z
Publisher: IEEE
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.
Relation: 2009 International Conference on Availability, Reliability and Security (ARES2009), Japan: 935-940
Appears in Collections:[數學系] 會議論文

Files in This Item:

File SizeFormat
2020100916001.pdf7KbAdobe PDF468View/Open


All items in NCUEIR are protected by copyright, with all rights reserved.

 


DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback