一种有效的多重秘密共享方案

An efficient multi-secret sharing scheme

文章提出了一般接入结构上的多重秘密共享方案。该方案可以动态地添加或删除参与者,动态地更新多重秘密;理论分析表明该方案满足秘密共享的安全性要求,是计算安全的;而实验结果证实该方案操作简单,非常有效;另外,为了防止分发者与参与者的欺诈,提出了可验证的方案;在可验证方案中,基于离散对数问题,各参与者可以检验属于自己份额的共享的正确性。

This paper proposes a multi-secret sharing scheme in common access structure. The scheme can dynamically add or delete the participants and dynamically renew multiple secrets. The theoretic analysis shows that the scheme can guarantee the security of the secret sharing and it is computational- ly secure,and the experiment results prove that it is very easy and efficient to realize it. Furthermore, to detect cheating and identify the cheater, a scheme, the respective participants receiving verified scheme is presented accordingly. In the verified the shares can verify their validity based on the discrete logarithm problem （DLP）.