| dc.contributor | 資科系 | en_US |
| dc.creator (作者) | 左瑞麟 | zh_TW |
| dc.creator (作者) | Tso,Raylin | en_US |
| dc.creator (作者) | Huang,Xinyi | en_US |
| dc.creator (作者) | Yi,Xun | en_US |
| dc.date (日期) | 2011.02 | en_US |
| dc.date.accessioned | 7-Aug-2014 14:41:50 (UTC+8) | - |
| dc.date.available | 7-Aug-2014 14:41:50 (UTC+8) | - |
| dc.date.issued (上傳時間) | 7-Aug-2014 14:41:50 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/68435 | - |
| dc.description.abstract (摘要) | The notion of certificateless cryptography is aimed to eliminate the use of certificates in traditional public key cryptography and also to solve the key-escrow problem in identity-based cryptography. Many kinds of security models have been designed for certificateless cryptography and many new schemes have been introduced based on the correspondence of the security models. In generally speaking, a stronger security model can ensure a certificateless cryptosystem with a higher security level, but a realistic model can lead to a more efficient scheme. In this paper, we focus on the efficiency of a certificateless signature (CLS) scheme and introduce an efficient CLS scheme with short signature size. On one hand, the security of the scheme is based on a realistic model. In this model, an adversary is not allowed to get any valid signature under false public keys. On the other hand, our scheme is as efficient as BLS short signature scheme in both communication and computation and, therefore, turns out to be more efficient than other CLS schemes proposed so far. We provide a rigorous security proof of our scheme in the random oracle model. The security of our scheme is based on the k-CAA hard problem and a new discovered hard problem, namely the modified k-CAA problem. Our scheme can be applied to systems where signatures are typed in by human or systems with low-bandwidth channels and/or low-computation power. | en_US |
| dc.format.extent | 487674 bytes | - |
| dc.format.mimetype | application/pdf | - |
| dc.language.iso | en_US | - |
| dc.relation (關聯) | The Journal of Sumpercomputing,55(2),173-191 | en_US |
| dc.subject (關鍵詞) | Bilinear pairing;Certificateless signature;Cryptographic protocol;Digital signature;Random oracle model;Short signature | en_US |
| dc.title (題名) | Efficient and short certificateless signatures secure against realistic adversaries | en_US |
| dc.type (資料類型) | article | en |
| dc.identifier.doi (DOI) | 10.1007/s11227-010-0427-x | en_US |
| dc.doi.uri (DOI) | http://dx.doi.org/10.1007/s11227-010-0427-x | en_US |
