You are not logged in.

Efficient and short certificateless signatures secure against realistic adversaries

Tso, Raylin, Yi, Xun and Huang, Xinyi 2011, Efficient and short certificateless signatures secure against realistic adversaries, Journal of supercomputing, vol. 55, no. 2, pp. 173-191, doi: 10.1007/s11227-010-0427-x.

Attached Files
Name Description MIMEType Size Downloads

Title Efficient and short certificateless signatures secure against realistic adversaries
Author(s) Tso, Raylin
Yi, Xun
Huang, Xinyi
Journal name Journal of supercomputing
Volume number 55
Issue number 2
Start page 173
End page 191
Total pages 19
Publisher Springer-Verlag
Place of publication Berlin, Germany
Publication date 2011-02
ISSN 1573-0484
Keyword(s) bilinear pairing
certificateless signature
random oracle model
short signature
cryptographic protocol
digital signature
Summary 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.
Language eng
DOI 10.1007/s11227-010-0427-x
Field of Research 109999 Technology not elsewhere classified
Socio Economic Objective 970110 Expanding Knowledge in Technology
HERDC Research category C1.1 Refereed article in a scholarly journal
Copyright notice ©2011, Springer
Persistent URL http://hdl.handle.net/10536/DRO/DU:30064324

Document type: Journal Article
Collection: School of Information Technology
Connect to link resolver
 
Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved.

Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 24 times in TR Web of Science
Scopus Citation Count Cited 0 times in Scopus
Google Scholar Search Google Scholar
Access Statistics: 56 Abstract Views, 1 File Downloads  -  Detailed Statistics
Created: Fri, 13 Jun 2014, 12:01:12 EST

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.