Verifiable Secret Sharing and Its Applications Based on Bilinear Pairings
Changgen Peng · Jisuanji gongcheng · 2009
A knowledge commitment scheme is designed by making use of bilinear pairings,it satisfies hiding and binding of commitment.Using the scheme,a new secret sharing scheme is constructed.This scheme is a verifiable(t,n) threshold secret sharing scheme that its shares can be updated.Based on the threshold secret sharing,a verifiable(t,n) threshold signature scheme is structured.This scheme is forward secure,and shares of parties can be updated and need not compute the inverse element.