一种秘密共享新个体加入协议

摘要

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.%针对秘密共享方案提出了一种为新个体分配秘密份额的算法.该算法具有无需信任中心、无需改动原有秘密份额、仅需t个成员合作(t为门限)、6t次广播等优点.最后还证明了该算法具有高安全性,并且在可靠性和密钥管理方面优于Shuffling方案和Wong TM等人的算法.