Paper Info
Title
Unrestricted and compact certificateless aggregate signature scheme.
Abstract
A certificateless aggregate signature (CLAS) scheme employing a reduced signature size eliminates the complexity of certificate management in a traditional public key cryptosystem. A compact aggregate signature, where the size does not depend on the aggregate number, is desirable when the objective is to reduce storage cost and bandwidth. However, in conventional compact CLAS schemes, aggregation of signatures is restricted. The state information is meant to be used only once for security; it is generally used to restrict aggregation to signatures generated with the same state information. This paper proposes the first unrestricted and compact CLAS scheme where the signature size is constant and any combination of signatures can be aggregated. Aside from convenient storage and communication costs, our scheme is also equipped with a secure system against realistic adversaries. Moreover, we evaluate the performance of our CLAS scheme and demonstrate its effectiveness. Finally, this paper reveals that it is not possible to construct an unrestricted and compact CLAS scheme for a widely used structure with constant pairing computation.
Year
DOI
Venue
2019
10.1016/j.ins.2019.03.005
Information Sciences
Keywords
Field
DocType
Information security,Message authentication,Digital signature,Certificateless signature,Aggregate signature
State information,Public key cryptosystem,Pairing,Theoretical computer science,Bandwidth (signal processing),Artificial intelligence,Certificate Management Protocol,Machine learning,Mathematics,restrict,Computation,Aggregate signature
Journal
Volume
ISSN
Citations 
487
0020-0255
1
PageRank 
References 
Authors
0.36
0
2
Name
Order
Citations
PageRank
Keitaro Hashimoto111.04
Wakaha Ogata249947.42