An Kind of (t, n)Threshold Secret Sharing Based on Lagrange Insert Value
Yuan Dai · Beijing Youdian Xueyuan xuebao · 2004
By means of the intractability of Ellipse Curve Discrete Logarithm Problem (ECDLP), a (t, n) secret sharing threshold scheme based on Lagrange insert value is presented. Every participant is able to verify the share that he receives and those other participants show, but the secret share isn't given away. This scheme can prevent adversaries from getting the shares and the participants cheating each other efficiently. The problem of renew shared secret, dynamic sub-secret allocation are properly treated in this scheme. An example of the scheme using the small number is given. The security of the scheme is analyzed in the final.