Multi-secret sharing scheme based on bilinear map
Juan Qu · Jisuanji yingyong yanjiu · 2009
Based on bilinear maps and zhang's(1,t)encryption scheme,this paper presented a multi-secret sharing scheme which used the participants private key as his master shadow.In the scheme,each required participants selected his shadow by himself and one reusable secret shadow to be kept.At the same,the scheme avoid the flaw of the secret distribution method and the shares held by the participants were not reusable.Considering the scheme,there was no secure channel between the dealer and the participants and the scheme reduce the system price.Therefore,the proposed ID-based secret sharing scheme is more secure and effective than others.