| dc.contributor | 資科系 | |
| dc.creator (作者) | Tso, Ray-Lin | |
| dc.creator (作者) | 左瑞麟 | zh_TW |
| dc.date (日期) | 2014-04 | |
| dc.date.accessioned | 3-Jun-2015 12:33:36 (UTC+8) | - |
| dc.date.available | 3-Jun-2015 12:33:36 (UTC+8) | - |
| dc.date.issued (上傳時間) | 3-Jun-2015 12:33:36 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/75551 | - |
| dc.description.abstract (摘要) | Digital signatures with message recovery have come into limelight in recent years. Comparing with traditional digital signatures, it has the advantage of small data size of communication and is useful in applications where bandwidth is one of the main concerns. It also surpasses a short signature in the sense of having a randomized signing algorithm instead of a deterministic one. On the other hand, in order to eliminate the use of certificates in traditional public key cryptography and the key-escrow problem in ID-based cryptography, the notion of certificateless cryptography was introduced. Combing both advantages, Tso et al. in 2010 introduced the first certificatelss signature scheme with message recovery. The security of their scheme is based on the k-BDHI assumption - a relatively stronger complexity assumption. In this paper, we propose a new scheme. Our new scheme is more efficient than Tso et al.`s scheme in the signature verification phase. In addition, the security of our new scheme is rigorously proved based on a weak and more classic complexity assumption - the Computational Diffie-Hellman (CDH) assumption. © 2014 International Information Institute. | |
| dc.format.extent | 176 bytes | - |
| dc.format.mimetype | text/html | - |
| dc.relation (關聯) | Information (Japan), 17(4), 1559-1573 | |
| dc.subject (關鍵詞) | Bilinear pairing; CDH problem; Certificateless signature; Message recovery; Random oracle model | |
| dc.title (題名) | Certificateless signatures with message recovery | |
| dc.type (資料類型) | article | en |
