Efficient and Short Certificateless Signature

Full text for this resource is not available from the Research Repository.

Tso, Raylin, Yi, Xun and Huang, Xinyi (2008) Efficient and Short Certificateless Signature. Lecture Notes in Computer Science, 5339. pp. 64-79. ISSN 0302-9743

Abstract

A certificateless signature (CLS) scheme with short signature size is proposed in this paper. 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, 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, such as PDAs or cell phones.

Dimensions Badge

Altmetric Badge

Item type Article
URI https://vuir.vu.edu.au/id/eprint/5593
DOI https://doi.org/10.1007/978-3-540-89641-8_5
Official URL http://dx.doi.org/10.1007/978-3-540-89641-8
Subjects Historical > Faculty/School/Research Centre/Department > School of Engineering and Science
Historical > FOR Classification > 1005 Communications Technologies
Historical > SEO Classification > 8901 Communication Networks and Services
Keywords ResPubID14808, bilinear pairing, certificateless signature, random oracle, short signature
Citations in Scopus 39 - View on Scopus
Download/View statistics View download statistics for this item

Search Google Scholar

Repository staff login