You are not logged in.
Openly accessible

A concrete certificateless signature scheme without pairings

Ge, Aijun, Chen, Shaozhen and Huang, Xinyi 2009, A concrete certificateless signature scheme without pairings, in MINES 2009 : Proceedings of the International Conference on Multimedia Information Networking and Security, IEEE, Piscataway, N.J., pp. 374-377, doi: 10.1109/MINES.2009.100.

Attached Files
Name Description MIMEType Size Downloads
huang-aconcrete-2009.pdf Published version application/pdf 264.52KB 59

Title A concrete certificateless signature scheme without pairings
Author(s) Ge, Aijun
Chen, Shaozhen
Huang, Xinyi
Conference name Multimedia Information Networking and Security. Conference (2009 : Hubei, China)
Conference location Hubei, China
Conference dates 18-20 Nov. 2009
Title of proceedings MINES 2009 : Proceedings of the International Conference on Multimedia Information Networking and Security
Editor(s) [Unknown]
Publication date 2009
Conference series Multimedia and Information and Communication Technologies Conference
Start page 374
End page 377
Total pages 4
Publisher IEEE
Place of publication Piscataway, N.J.
Keyword(s) certificateless signature
bilinear pairing
discrete logarithm problem
random oracle model
strongly secure
Summary Certificateless public key cryptography was introduced to avoid the inherent key escrow problem in identity-based cryptography, and eliminate the use of certificates in traditional PKI. Most cryptographic schemes in certificateless cryptography are built from bilinear mappings on elliptic curves which need costly operations. Despite the investigation of certificateless public key encryption without pairings, certificateless signature without pairings received much less attention than what it deserves. In this paper, we present a concrete pairing-free certificateless signature scheme for the first time. Our scheme is more computationally efficient than others built from pairings. The new scheme is provably secure in the random oracle model assuming the hardness of discrete logarithm problem.
Notes This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
ISBN 9780769538433
Language eng
DOI 10.1109/MINES.2009.100
Field of Research 109999 Technology not elsewhere classified
Socio Economic Objective 970110 Expanding Knowledge in Technology
HERDC Research category E1.1 Full written paper - refereed
Copyright notice ©2009, IEEE
Persistent URL http://hdl.handle.net/10536/DRO/DU:30064213

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

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.

Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 0 times in TR Web of Science
Scopus Citation Count Cited 0 times in Scopus
Google Scholar Search Google Scholar
Access Statistics: 49 Abstract Views, 59 File Downloads  -  Detailed Statistics
Created: Wed, 11 Jun 2014, 12:49:24 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.