密码学报2016，Vol.3Issue(3)：229-237,9.DOI:10.13868/j.cnki.jcr.000123
带权重的动态可验证多秘密共享机制*
Weighted Dynamic and Verifiable Multi-Secret Sharing Scheme
摘要
Abstract
In complicated network environments, a weighted (t,n) secret sharing scheme allows each participant to own a different weight that describes the importance of the participant and the secret can be recovered by any subsets of participants when the sum of weights of the subsets is no less than a weighted threshold value, but the secret cannot be recovered if the sum of weights is smaller than the threshold value. However, there are some crucial problems to be solved, for example, how to balance the security and the computational overhead, how to improve the flexibility of the secret sharing schemes, and so on. To improve the schemes’ security, efficiency and practicality and thus reduce the computational overhead, this paper proposes a weighted dynamic and verifiable multi-secret sharing scheme based on the Chinese Remainder Theorem (CRT). In the secret reconstruction phase, the validity of the shadows are verified, and by the nature of the one-way function, which provides the simplicity and easy construction, it can achiece an improved efficiency of the scheme. The proposed scheme, which uses a technique to transform the secrets into a linear combination of polynomials, can share multiple secrets dynamically, and can add new secrets or delete existing secrets. The scheme has preferable practicality, and the participants can be removed or added freely.关键词
可验证多秘密共享/带权重/动态/中国剩余定理/哈希函数Key words
verifiable multi-secret sharing scheme/weighted/dynamic/Chinese remainder theorem/one-way hash function分类
信息技术与安全科学引用本文复制引用
张明武,陈泌文,谢海涛..带权重的动态可验证多秘密共享机制*[J].密码学报,2016,3(3):229-237,9.基金项目
国家自然科学基金(61370224) （61370224）
福建省网络安全与密码技术重点实验室(福建师范大学)开放课题(15006) （福建师范大学）
