National Changhua University of Education Institutional Repository : Item 987654321/12209
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 6507/11669
造访人次 : 30033302      在线人数 : 568
RC Version 3.2 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 进阶搜寻

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.ncue.edu.tw/ir/handle/987654321/12209

题名: Towards Efficient ID-based Signature Schemes with Batch Verifications from Bilinear Pairings
作者: Tseng, Yuh-Min;Wu, Tsu-Yang;Wu, Jui-Di
贡献者: 數學系
日期: 2009-03
上传时间: 2012-07-03T03:46:49Z
出版者: IEEE
摘要: 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.
關聯: 2009 International Conference on Availability, Reliability and Security (ARES2009), Japan: 935-940
显示于类别:[數學系] 會議論文

文件中的档案:

档案 大小格式浏览次数
2020100916001.pdf7KbAdobe PDF591检视/开启


在NCUEIR中所有的数据项都受到原著作权保护.

 

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