A threshold multi-secret sharing scheme

This paper proposes a threshold multi-secret sharing scheme. In such a scheme, many secrets are shared in such a way that all secrets can be reconstructed independently without refreshing the shares. Every share is of the same size as that of any single shared secret in the proposed scheme. The number of public values in the proposed scheme is same as that of He and Dawson's scheme, which has been proved that it is only one-time-use scheme, but the proposed scheme is a multi-use scheme really, what is more important, it is more efficient since there will be t(i) secrets to be shared and reconstructed at the same time according to each (t(i),n)-threshold access structure. That is, there are more secrets to be shared and reconstructed in the proposed scheme.