Research On Certificateless Signature Algorithm Without Bilinear Mapping

Certificateless public key cryptosystem which is attracted great interest can solve the certificate management issue,at the same time,which can also avoid key escrow in ID-based cryptography.Certificateless signature is the important part of modern cryptography and one of the core technologies of information security.It inherits the advantage of the Certificateless public key cryptosystem,at the mean time,which verify the integrity of information,authenticate the identity of information sender,avoid the user's denial behavior and provide the reliability for information transmission.Certificateless aggregate signature on the basis of certificateless signature,which can provide non-repudiation services to multiple messages and users in the meanwhile;on the premise of limited bandwidth,the signature of the multiple users can be compressed into a signature,which reduce the signature storage space and the verification of the signature also can be simplified to a single verification,which resduce the workload of signature verification.Among the existing partial certificateless signature and certificateless aggregate signature have shortcomings in security and computational efficiency,either if it will fail to resist the public key substitution attack against the type I adversary,can not meet the requirement of the strong security in the real application environment or are based on bilinear pairing or use a great amount of the multiplication,lead to the large calculation amount of the scheme and the low efficiency of the scheme,In the consideration of the inherent advantages of certificateless and certificateless aggregate signatures(no certificate management,no key escrow),which are attractive to applications in the limited resources and network environments and need a large number of signature verification.So,this paper has carried on the thorough research to the certificateless and certificateless aggregate signatures,provided the signature that meet the requirement of strong security and high computing efficiency.Specifically,there are the following research results:(1)Design a new secure and efficient certificateless signature scheme without bilinear parings,the unforgeability of the signature is proved in the random oracle model with assuming the elliptic curve discrete logarithm problem holds,and the keyless escrow,non-repudiation and forward/backward security of the scheme are analyzed.The efficiency analysis shows that the proposal only uses three multiplications in signature process and four multiplications in verification process.Compared to the existing scheme,the proposal are more security and practical(2)Design a new secure and efficient certificateless aggregate signature scheme without bilinear parings,the unforgeability of the signature is proved in the random oracle model with assuming the elliptic curve discrete logarithm problem holds,and the keyless escrow,public verification and non-repudiation of the scheme are analyzed.The efficiency analysis shows that the proposal only uses three multiplications in signature process and four multiplications in verification process.Compared to the existing scheme,the proposal are more security and practical...