A Secure and Efficient Threshold Multi-secret Sharing Scheme
一个安全高效的门限多重秘密共享方案

Secret sharing plays an important role in information security and data privacy.Based on Shamir's threshold scheme,a new(t,n)multi-secret sharing scheme is proposed in this paper.In this scheme,there are p secrets shared among n participants and at least t or more participants can easily reconstruct these p secrets at the same time.Each participant's secret shadow is as short as each secret.Compared with the existing schemes,the proposed scheme is characterized by the lower complexity of the secret reconstruction and less public information.The security of this scheme is the same as that of Shamir's threshold scheme.Analyses show that this scheme is a secure and efficient scheme.