Provable Secure Identity-Based Threshold Signcryption Scheme in the Standard Model

An efficient identity-based threshold signcryption scheme was presented.With bilinear pairings technology,a proved secure threshold signcryption scheme was designed in the standard model,based on Waters and Paterson's signature scheme.We prove its semantic security on the hardness of decisional bilinear Diffie-Hellman problem and its unforgeability on the hardness of computational Diffie-Hellman problem.Compared with other schemes in the random oracle model,this scheme is more meaningful.