Abstract: In the available weighted secret sharing scheme, only one secret can be shared in one sharing session. A weighted threshold multi-secret sharing scheme is proposed. By using the Chinese remainder theorem, many secrets mapping to one parameter is presented, when the sum of weights of the participants is as big as or bigger than the threshold value, they can recover the secret. Analysis shows that the proposed scheme is secure and has advantages of less communication.

Key words: weighted threshold, multi-secret sharing, discrete logarithm, Hash function

摘要： 现有加权秘密共享方案一次只能共享一个秘密。为此，提出一种参与者有权重的门限多秘密共享方案。利用中国剩余定理，将每次要共享的多个秘密映射到一个参数中，当参与者权重之和大于等于门限值时，恢复多个秘密。分析结果表明，该方案具有较高的安全性，且通信量较低。

关键词: 加权门限, 多秘密共享, 离散对数, Hash函数

CLC Number: 

• TP393