A New (t,n)-Threshold Secret Sharing Scheme
Chunming Tang, Zheng‐an Yao · 2008
In a traditional (t,n)-threshold secret sharing scheme, the secret key K can be shared only one time for this reason that one of participants, who participates in reconstruction of K, may be dishonest and probably leaks K. In this paper, based on multiprover zero-knowledge arguments and secure multiparty computation protocol, we will construct a (t,n)-threshold secret sharing scheme in which the secret key K will be shared forever if at most t-1 participants are dishonest and discrete logarithm problem is hard.