关键词: 双线性对, 公开验证, 单向散列链, 双线性Diffie-Hellman问题, 计算Diffie-Hellman问题, 随机预言模型

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 performance of the scheme ae given in detail and the security of the scheme is proved in the random oracle model. Under assumptions 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.

Key words: bilinear pairing, publicly verifiable, one-way hash chain, bilinear Diffie-Hellman problem, computer Diffie-Hellman problem, random oracle model