A Daynamic (k,n)-threshold secret sharing scheme based on discrete logarithm
基于离散对数的动态(k,n)-门限方案

A dynamic (k,n)-threshold secret sharing scheme based on discrete logarithm is proposed in this paper. It can reconstruct the different system secrets for many times without any restriction. Any cheater can be checked out. When some participants' secret sharing values are revealed, they can be renewed without any effect on the others. It is convenient to add or to delete one or more participants. The system secret can be recovered with a parallel process.