ID-based public verifiability signcryption scheme

Using bilinear pairing,a new identity-based signcryption scheme was proposed in this paper.Under the assumption that the Computational Diffie-Hellman(CDH) problem is hard,the newly proposed scheme had been proved to be secure against the existing unforgeability on adaptively chosen message/ciphertext and identity attack in random oracle model.The advantage of the proposed scheme is that it is identity-based which needs no certificates so that it has a simple key management.In addition,the proposed scheme can provide public verifiability,and it allows a third party to convince that the signcryption is valid for the given message without providing the receiver's private key.