Abstract: A provably secure  (t,n)  certificateless threshold signcryption scheme was proposed in the standard model, where the ciphertext can only be produced by arbitrary t or more members working together. In addition, the unforgeability and semantic security of the scheme were proved formally. In the last, the scheme was proved to be more secure and efficient in contrast with the existing schemes.