Certificateless Signature and Group Signature Schemes Based on Bilinear Pairings

Traditional digital signature schemes need much more storage and management overhead for the use of certificates,while the identity-based digital signature schemes fail to solve the inherent key-escrow problem.Certificateless signature schemes need no certificates and can solve the key-escrow problem.This paper presents a certificateless signature scheme from bilinear pairings,and verifies its security under the random oracle machine.It designs a certificateless group signature scheme from the certificateless signature scheme,and its security is founded under the assumption of the computational Diffie-Hellman problem.Performance analysis shows that both signature schemes are secure and have high performing efficiency.