Efficient Certificateless Aggregate Signature Scheme

In ubiquitous computing, data should be able to be accessed from any location, and the correctness of data becomes vital during the communication. Suppose that many users sign different messages respectively, before forwarding or sending these messages, then the verifier must spend a lot of computing time to verify their signatures. Consequently, the aggregate signature scheme is an effective method of improving efficiency in this kind of systems, which provides the convenience for the verifier. In this paper, we propose a new certificateless aggregate signature scheme which is efficient in generating a signature and verification. This scheme is provably secure under the extended computational Diffie-Hellman assumption.

[1]  Duncan S. Wong,et al.  Certificateless Public-Key Signature: Security Model and Efficient Construction , 2006, ACNS.

[2]  Craig Gentry,et al.  Identity-Based Aggregate Signatures , 2006, Public Key Cryptography.

[3]  Duc-Phong Le,et al.  Refinements of Miller's Algorithm over Weierstrass Curves Revisited , 2011, Comput. J..

[4]  Adi Shamir,et al.  Identity-Based Cryptosystems and Signature Schemes , 1984, CRYPTO.

[5]  Lei Zhang,et al.  A new certificateless aggregate signature scheme , 2009, Comput. Commun..

[6]  Gwoboa Horng,et al.  A PROVABLY SECURE CERTIFICATELESS PROXY SIGNATURE SCHEME , 2011 .

[7]  Gwoboa Horng,et al.  A PROV ABLY SECURE CERTIFICATELESS PROXY SIGNATURE SCHEME , 2011 .

[8]  Xinmei Wang,et al.  Identity-based multisignature and aggregate signature schemes from m-torsion groups , 2006 .

[9]  Zuhua Shao,et al.  Fair exchange protocol of signatures based on aggregate signatures , 2008, Comput. Commun..

[10]  Kefei Chen,et al.  An Adaptive Stable Link Selection Algorithm for Mobile Ad Hoc Networks , 2007 .

[11]  Dengguo Feng,et al.  ID-Based Aggregate Signatures from Bilinear Pairings , 2005, CANS.

[12]  Hovav Shacham,et al.  Aggregate and Verifiably Encrypted Signatures from Bilinear Maps , 2003, EUROCRYPT.

[13]  Gwoboa Horng,et al.  Further refinement of pairing computation based on Miller's algorithm , 2007, Appl. Math. Comput..

[14]  Tzong-Chen Wu,et al.  ID-based group-oriented cryptosystem and its digital signature scheme , 1997, Comput. Commun..

[15]  Kefei Chen,et al.  Two Certificateless Aggregate Signatures From Bilinear Maps , 2007, Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007).

[16]  Chun-I Fan,et al.  Fast Randomization Schemes for Chaum Blind Signatures , 2009 .

[17]  Mihir Bellare,et al.  Random oracles are practical: a paradigm for designing efficient protocols , 1993, CCS '93.

[18]  Kenneth G. Paterson,et al.  Certificateless Public Key Cryptography , 2003 .