Efficient pairing-based and identity-based generalized signcryption scheme

To improve the efficience,this paper proposed a new efficient identity-based generalized signcryption scheme using the bilinear pairings and the ideas of generalization.Proved the proposed scheme to be message confidentiality non-repudiation and unforgeability under the random oracle model.As compared with the only-one identity-based gernalized signcryption scheme to date,the proposed scheme decreases two pairing operations,and is more efficient.