摘要： 针对当前多数秘密共享方案存在着增加或删除成员时必须重新计算其它成员的秘密份额等问题，提出了一个基于广义接入结构的高效的多秘密分享方案。在该方案中秘密管理者可高效地增加或删除成员，无须重新计算其它成员的秘密份额。此外，该方案不仅可高效地检测秘密管理者与参与者的欺诈行为，而且参与者可采用并行算法恢复子秘密。

关键词: 秘密共享, 欺诈, 因式分解问题, 离散对数

Abstract: Most secret sharing schemes have the problem that other participants’ shadow must be recalculated if an old participant is deleted or a new participant is added. An efficient multi-secret sharing scheme has been proposed based on general access structure. In the proposed scheme, the dealer can add a new participant or delete an old participant without changing other participants’ shadow. Moreover, the scheme not only can detect the cheating of the dealer or any participant efficiently, but also the participants can reconstruct a secret with parallel procedure in a secret recovery phase

Key words: Secret sharing, Cheating, Factorization problem, Discrete logarithm

中图分类号: 

• TP309