Improement of Threshold Secret Sharing Scheme Based on Polynomial Ring and ECC
Xiaoyao Xie · Guizhou kexue · 2011
On the basis of Shamir threshold secret sharing scheme,this paper brought a new idea of two-level polynomial interpolation and reconstruction of the shared master key,improved the(t,n) threshold secret sharing scheme based on polynomial ring and the elliptic curve discrete logarithm problem(ECDLP).The new scheme was based on the complexity of two-level polynomial reconstruction and the intractability of ECDLP.The new scheme also introduced identity of secret sharer,created two-dimensional sub-key to decentralize the risks of sub-key revealed.It also had the function to dynamically manage shared sub-key.Theoretical analysis showsed that security of the new scheme was better than the original(t,n) threshold secret sharing scheme.