Dynamic(t,n) threshold multi-secret sharing scheme
Xuehan Cheng · Jisuanji yingyong yanjiu · 2008
Based on a one-way function and the large-integer factorization problem,proposed an efficient and dynamic(t,n) threshold multi-secret sharing scheme.By this scheme,the dealer could arbitrarily give any set of multiple secrets to be kept by every participant;meanwhile,it could efficiently prevent both dealer cheating and other participants cheating,and the computation of a secret recovery was overhead.Considering the scheme,it was easy for new participants to join. However,the revocation schemes were always difficult.A novel revocation scheme is used,which needs little computational cost at the user end,without affecting any of the other performance parameters.