一个安全高效的门限多重秘密共享方案

秘密共享在信息安全和数据保密中起着重要的作用。本文基于Shamir的门限方案提出一个新的（t,n）多重秘密共享方案，P个秘密被n个参与者所共享，至少t个参与者联合可以一次性重构这P个秘密，而且参与者秘密份额长度与每个秘密长度相同。与现有方案比较，该方案具有秘密重构计算复杂度低，所需公共信息量小的优点。方案的安全性是基于Shamir的门限方案的安全性。分析表明本文的方案是一个安全、有效的方案。

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.