A verifiable threshold multi-secret sharing scheme is proposed in this paper.As the secret can be recovered with the shadows provided by participants and it is computationally difficult to get the sub-keys from the shadows

the sub-keys can be reused to share the multi-secret in this scheme.By verifying the information published by the dealer as well as the shadows of sub-keys provided by participants

this scheme can prevent both dealer and participant from cheating.The security of this scheme is the same as that of RSA cryptosystem and Shamir’s (

k

n

)-threshold scheme.Two kinds of cheating methods against threshold multi-secret sharing scheme are also proposed

which can threaten the security of previous schemes more or less.But the scheme proposed in this paper provides efficient solutions against these cheatings and achieves the same computational securi

ty with a better performance compared with the previous schemes.