Dynamic threshold multi-secret sharing scheme based on bilinear pairing
Shen Rui-xue · Jisuanji gongcheng yu sheji · 2012
In order to address the problems that many current threshold secret sharing schemes are based on RSA cryptosystem and thresholds are invariant.After analyzing the literature of other multi-secret sharing scheme,a dynamic threshold multi-secret sharing scheme based on bilinear pairing and elliptic curve is proposed.In the scheme,multi-level threshold is realized by a polynomial,and the identity of participants can be authenticated through bilinear pairing,therefore,secret security is abled to be guaranteed on any occasion.Because no scure channel is used,the scheme has low communication comsuption and high effiency,and can prevent cheating.Moreover,the scheme renew the sharing secrets,which improve the security of the scheme.And the analysis indicates that it's a scure and effective dynamic threshold signature scheme.