Journal
COMPUTER COMMUNICATIONS
Volume 32, Issue 6, Pages 1079-1085Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.comcom.2008.12.042
Keywords
Certificateless cryptography; Aggregate signature; Certificateless aggregate signature; Computational Diffie-Hellman problem; Random oracle model
Categories
Funding
- national nature science foundation of China [60673070]
- nature science foundation of Jiangsu province [BK2006217]
- Spanish Government
- [TSI2007-65406-C03-01]
Ask authors/readers for more resources
Aggregate signatures are useful in special areas where the signatures on many different messages generated by many different users need to be compressed. In this paper, we study aggregate signatures in certificateless public key settings. We first present the notion and security model of certificateless aggregate signature schemes. Then we give an efficient certificateless aggregate signature scheme. Our scheme is existentially unforgeable under adaptive chosen-message attacks assuming the computational Diffie-Hellman problem is hard. Crown Copyright (C) 2009 Published by Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available