一个可验证的秘密共享新个体加入协议

Verifiable Protocol for Member Expansion in Secret Sharing Schemes

针对门限秘密共享方案,提出了一个可验证的新个体加入协议.应用指数运算来验证新产生份额的真实性,从而预防系统中可能出现的主动攻击.该协议具有无需信任中心,无需改动原有参与者的份额,仅需t(t为门限)个老成员合作产生新份额,仅需6t次广播等优点.分析与验证表明,该协议是正确的,与现有协议相比,其密钥管理简单,安全性更高,具有良好的可靠性和可用性.

A verifiable protocol for member expansion in the threshold sharing schemes that create n shares of the secret for n participants was proposed. The authenticity of the new share can be verified by using exponential computation, which makes the protocol defend against active adversaries. Without a trusted center and modifying the shares of old participants, the protocol needs that t （t is the threshold） old participants cooperate to generate and to distribute the new share, and there are only 6t times broadcasting. The validity of the proposed protocol was verified. Compared with the existing protocols, the proposed protocol has a higher security and is easier in key management and better in reliability and usability.