In a multi-secret sharing scheme, a large number of public values are generated to ensure the secure and correct reconstruction of multi-secrets, and participants also need to keep a large amount of information. In order to reduce the number of public values and the information that participants should keep, this study designs a multi-secret sharing scheme based on the Chinese Remainder Theorem (CRT) and Shamir (t, n)-threshold secret sharing scheme in which shares can be used more than once. Specifically, the shares generated by polynomials are aggregated to generate public values by CRT, which reduces the number of public values. Transformed value and discrete logarithms are used to protect the shares of participants. In a multi-secret sharing scheme, multiple secrets can be shared at one time; different secrets can be shared in access structures with different thresholds; participants can verify the secrets recovered; the number of public values is fewer; each participant only needs to store one share which can be used repeatedly.