Provable Secure Hierarchical Identity Based Signature Scheme in the Standard Model
Sun Chunhui · Xi'an Jiaotong Daxue xuebao · 2011
Aiming at the intrinsic problems in hierarchical identity based signature(HIBS) schemes,such as enhancing the security,shortening the signature length,and reducing the computational costs,a novel hierarchical identity based signature scheme is proposed.The available schemes always handle the message as an entirety in the signature process;while our scheme processes the message as segments so that the scheme is not only efficient but also achieves higher security level.The suggested scheme is more secure than the existing schemes since it is proved secure in the standard model over full identity adaptive chosen message attack,and its security is reduced to computational Diffie-Hellman(CDH) assumption.The hardness of CDH assumption is superior to the other assumptions except the discrete logarithm problem.The new scheme has some efficiency advantages over the available schemes: the size of the signature is a constant,verification requires only three bilinear pairing operations,and the private keys size shrinks as the identity depth increases.The efficiency and security analysis shows that the proposed scheme is more secure and efficient compared with the existing HIBS schemes.