A Secret Sharing Scheme with Periodic Renewing to Identify Cheaters
Chunxiao Xu · Chinese Journal of Computers · 2002
A (k,n) threshold secret sharing scheme is a method of sharing a secret K among a set of n participants,in such a way that any k participants can compute the value K , but no group of k 1 participants can do so. It has found wide applications in practice. By means of the intractability of discrete logarithm problem, a (k,n) threshold secret sharing scheme with periodic renewing to identify cheaters is proposed. Shares are periodically renewed without changing the secret. Every participant is able to verify the share he receives and those other participants show. This scheme can prevent adversaries from getting the secret or shares and the participants cheating each other efficiently. Because a trusted dealer distributes the secret information in the initialization phase and renewing phases, the amount of data transmitted and calculation time are reduced.