计算机工程与应用Issue(2)：117-126,10.DOI:10.3778/j.issn.1002-8331.1401-0270
可公开验证可定期更新的多秘密共享方案
Publicly verifiable and periodically renewable multi-secret sharing scheme
张敏 1杜伟章1
作者信息
- 1. 长沙理工大学 计算机与通信工程学院，长沙 410114
- 折叠
摘要
Abstract
A publicly verifiable and periodically renewable multi-secret sharing scheme is proposed, which is based on the YCH scheme and the properties of bilinear pairings. The secret shares can be verified publicly and updated periodically with keeping the advantages of YCH scheme. The secrets can be reconstructed while one participant only needs holding one secret share. The features of the one-way hash chain are used to make secret shares publicly verifiable and regularly renewable. Anyone can verify the effectiveness of the public information and the correctness of the secret shares. The cheating of the distributor and participants can be prevented effectively. Finally, analyses of the correctness and perfor-mance of the scheme ae given in detail and the security of the scheme is proved in the random oracle model. Under assump-tions of the discrete logarithm problem of the elliptic curve, bilinear Diffie-Hellman problem and computer Diffie-Hellman problem, the analysis indicates that the mentioned scheme is safe and effective.关键词
双线性对/公开验证/单向散列链/双线性Diffie-Hellman问题/计算Diffie-Hellman问题/随机预言模型Key words
bilinear pairing/publicly verifiable/one-way hash chain/bilinear Diffie-Hellman problem/computer Diffie-Hellman problem/random oracle model分类
信息技术与安全科学引用本文复制引用
张敏,杜伟章..可公开验证可定期更新的多秘密共享方案[J].计算机工程与应用,2016,(2):117-126,10.
