Research Repository

Efficient and Short Certificateless Signature

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

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

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.

Item Type: Article
Uncontrolled Keywords: ResPubID14808, bilinear pairing, certificateless signature, random oracle, short signature
Subjects: Faculty/School/Research Centre/Department > School of Engineering and Science
FOR Classification > 1005 Communications Technologies
SEO Classification > 8901 Communication Networks and Services
Related URLs:
Depositing User: VUIR
Date Deposited: 10 Oct 2011 23:06
Last Modified: 10 Oct 2011 23:06
URI: http://vuir.vu.edu.au/id/eprint/5593
DOI: 10.1007/978-3-540-89641-8_5
ePrint Statistics: View download statistics for this item
Citations in Scopus: 12 - View on Scopus

Repository staff only

View Item View Item

Search Google Scholar