Abstract: An efficient multi-secret sharing scheme with a generalized access structure based on bilinear pairing was proposed. Each participant's private key was used as his secret share. No security channel existed between the dealer and the participants. The shadows of the participants did not need to reselect when the system accepted a new participant or fired an old participant, which was easier to implement. The analysis shows that this scheme is correct, can prevent the participant's cheating attacks, and the sub-secrets of participants can be shared.

Key words: bilinear pairing, dynamic, general secret sharing

摘要： 利用双线性对构建了一个具有广义接入结构的高效的多秘密共享方案。每个参与者的私钥作为其子秘密,秘密分发者和参与者之间无需维护安全信道。方案能够动态地增加或删除成员,而其他成员无需重新选择子秘密,减少了方案实施的代价。分析表明,该方案是正确的,能防止参与者之间相互欺骗攻击,且参与者的子秘密可复用。

关键词: 双线性对, 动态, 广义秘密共享