A Non-Interactive Protocol for Member Expansion in a Secret Sharing Scheme
一种秘密共享新个体加入协议

This paper presents a new secret redistribution protocol for threshold sharing schemes that create n shares of the secret for n shareholders. Without having a trusted center, the protocol only requires t (t is the threshold) participants' cooperation and 6t times broadcasting to generate and to distribute the new share. At the end, it is demonstrated that the algorithm has a higher security and is better than the Shuffling scheme and Wong's protocol on reliability and secret management.