摘要： 基于Shamir门限方案和RSA密码体制提出一种动态门限多组秘密共享方案。该方案中的多秘密分发者可根据所共享秘密的重要性，动态调整恢复该秘密时的门限值，使 组秘密根据不同的门限值在 个参与者中共享。方案可以灵活地增加或删除成员，无需更改其他成员的秘密份额。任何人可在秘密重构阶段验证每个合作的参与者是否进行欺诈，且无需专门的验证协议。
关键词:
动态秘密共享,
门限方案,
多秘密共享,
RSA密码体制
Abstract: Based on Shamir’s threshold scheme and the RSA cryptosystem, a dynamic threshold multi-group-secret sharing scheme is proposed. In the proposed scheme, the dealer can adjust the threshold value depending on the secure level of different sharing value, so m groups of secrets can be shared among n participants. The shadows of other participants do not need to be changed when a participant is added or deleted. Anybody is allowed to check whether a cooperative participant provides the true information or not in the recovery phase, and it doesn’t need to design special verification algorithm.
Key words:
dynamic secret sharing,
threshold scheme,
multi-secret sharing,
RSA cryptosystem
中图分类号:
乔晓林, 张建中. 一种动态门限多组秘密共享方案[J]. 计算机工程, 2010, 36(22): 143-144.
JIAO Xiao-Lin, ZHANG Jian-Zhong. Dynamic Threshold Multi-group-secret Sharing Scheme[J]. Computer Engineering, 2010, 36(22): 143-144.