學術產出-Periodical Articles

Article View/Open

Publication Export

Google ScholarTM

政大圖書館

Citation Infomation

  • No doi shows Citation Infomation
題名 Strongly secure certificateless signature: Cryptanalysis and improvement of two schemes
作者 Chen, Y.-C.;Tso, Raylin;Horng, G.;Fan, C.-I.;Hsu, R.-H.
左瑞麟
貢獻者 資訊科學系
日期 2015
上傳時間 9-Apr-2015 17:42:09 (UTC+8)
摘要 Short certificateless signatures have come into limelight in recent years. On the one hand, the property of certificateless eliminates the certificate management problem in traditional PKI and the key-escrow problem in some ID-based signature schemes. On the other hand, due to the short signature length, short certificateless signatures can be applied to systems where signatures are typed in by human or systems with low-bandwidth channels and/or low-computation power, such as PDAs or cell phones. However, there has been a trade-off between short certificateless signature schemes and their security levels. All existing short certificateless signature schemes can only be proven secure against a normal type adversary rather than a stronger one, who can obtain valid certificateless signatures under public keys replaced by the adversary. In this paper, we solve this open problem by given an efficient strongly secure short certificateless signature scheme. The proposed scheme has the following features. Firstly, it is strongly unforgeable. Secondly, the security can be reduced to the Computational Diffie-Hellman (CDH) assumption - a classic complexity assumption. Lastly, the proposed scheme is provably secure against adversaries with access to a super signing oracle which generates valid certificateless signatures of messages and public keys chosen by the adversary (without providing the corresponding secret values). © 2012 Elsevier Inc. All rights reserved.
關聯 Journal of Information Science and Engineering,31,297-314
資料類型 article
dc.contributor 資訊科學系-
dc.creator (作者) Chen, Y.-C.;Tso, Raylin;Horng, G.;Fan, C.-I.;Hsu, R.-H.-
dc.creator (作者) 左瑞麟-
dc.date (日期) 2015-
dc.date.accessioned 9-Apr-2015 17:42:09 (UTC+8)-
dc.date.available 9-Apr-2015 17:42:09 (UTC+8)-
dc.date.issued (上傳時間) 9-Apr-2015 17:42:09 (UTC+8)-
dc.identifier.uri (URI) http://nccur.lib.nccu.edu.tw/handle/140.119/74438-
dc.description.abstract (摘要) Short certificateless signatures have come into limelight in recent years. On the one hand, the property of certificateless eliminates the certificate management problem in traditional PKI and the key-escrow problem in some ID-based signature schemes. On the other hand, due to the short signature length, short certificateless signatures can be applied to systems where signatures are typed in by human or systems with low-bandwidth channels and/or low-computation power, such as PDAs or cell phones. However, there has been a trade-off between short certificateless signature schemes and their security levels. All existing short certificateless signature schemes can only be proven secure against a normal type adversary rather than a stronger one, who can obtain valid certificateless signatures under public keys replaced by the adversary. In this paper, we solve this open problem by given an efficient strongly secure short certificateless signature scheme. The proposed scheme has the following features. Firstly, it is strongly unforgeable. Secondly, the security can be reduced to the Computational Diffie-Hellman (CDH) assumption - a classic complexity assumption. Lastly, the proposed scheme is provably secure against adversaries with access to a super signing oracle which generates valid certificateless signatures of messages and public keys chosen by the adversary (without providing the corresponding secret values). © 2012 Elsevier Inc. All rights reserved.-
dc.format.extent 2036781 bytes-
dc.format.mimetype application/pdf-
dc.relation (關聯) Journal of Information Science and Engineering,31,297-314-
dc.title (題名) Strongly secure certificateless signature: Cryptanalysis and improvement of two schemes-
dc.type (資料類型) articleen