An Efficient (t, n)-Threshold Multi-Secret Sharing Scheme

An efficient (t, n) threshold multi-secret sharing scheme is proposed in this paper. This scheme has the same power as Yang et al. ´s scheme, in which there are p (p > 1) secrets to be shared among n participants according to (t, n)-threshold access structure. But it uses the fixed ( t -1 )th degree Lagrange interpolation polynomial whenever p les t or p > t while Yang et al.´ scheme employs the (t-1), (p-1)th degree Lagrange interpolation polynomial when p les t, p > t, respectively. Thus, the computing time and the storage cost of this scheme is less than that of Yang et al.´s scheme.