政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/68435

政大典藏 > College of Informatics > Department of Computer Science > Periodical Articles > Item 140.119/68435

Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/68435

Title:	Efficient and short certificateless signatures secure against realistic adversaries
Authors:	左瑞麟 Tso,Raylin Huang,Xinyi Yi,Xun
Contributors:	資科系
Keywords:	Bilinear pairing;Certificateless signature;Cryptographic protocol;Digital signature;Random oracle model;Short signature
Date:	2011.02
Issue Date:	2014-08-07 14:41:50 (UTC+8)
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.
Relation:	The Journal of Sumpercomputing,55(2),173-191
Data Type:	article
DOI link:	http://dx.doi.org/10.1007/s11227-010-0427-x
DOI:	10.1007/s11227-010-0427-x
Appears in Collections:	[Department of Computer Science ] Periodical Articles

Files in This Item:

File	Description	Size	Format
173-191.pdf		476Kb	Adobe PDF2	890	View/Open

社群 sharing

Loading...