資料載入中.....
|
請使用永久網址來引用或連結此文件:
http://ir.ncue.edu.tw/ir/handle/987654321/12169
|
題名: | AN EFFICIENT AND PROVABLY SECURE ID-BASED SIGNATURE SCHEME WITH BATCH VERIFICATIONS |
作者: | Tseng, Yuh-Min;Wu, Tsu-Yang;Wu, Jui-Di |
貢獻者: | 數學系 |
關鍵詞: | Security;Bilinear pairings;ID-based;Signature;Batch verification |
日期: | 2009-11
|
上傳時間: | 2012-07-03T03:45:22Z
|
出版者: | ICIC International |
摘要: | A secure signature scheme with providing variant batch verifications ex- tremely improves the verification performance for many cooperative and distributed appli- cations. 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 sig- nature 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 computa- tional 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. |
關聯: | International Journal of Innovative Computing, Information and Control, 5(11): 3911-3922 |
顯示於類別: | [數學系] 期刊論文
|
文件中的檔案:
檔案 |
大小 | 格式 | 瀏覽次數 |
index.html | 0Kb | HTML | 684 | 檢視/開啟 |
|
在NCUEIR中所有的資料項目都受到原著作權保護.
|