Abstract: This paper proposes a new verifiable secret redistribution protocol according to threshold secret sharing schemes that create n shares of the secret for n shares of old participants,the protocol only requires t（t is the threshold） participants’ cooperation and（3t+2） times broadcasting to generate and to distribute the new share.The validity of the proposed protocol has a higher security and is easier in key management and better in reliability and usability.

Key words: secret sharing, new member, verify, trusted center

摘要： 基于Shamir门限秘密共享方案,提出了一个可验证的为新个体分配子秘密的算法。该算法具有无需信任中心,无需改动原有子秘密,仅需（3t+2）次广播,t个老成员合作（t为门限）等优点。经过分析与验证,该算法是正确的,与现有的协议相比,其安全性高,性能好,具有良好的可靠性和可用性。

关键词: 秘密共享, 新个体, 验证, 信任中心