New(2,n)Threshold Secret Sharing Scheme with Share Refreshing Based on XOR Operations
Li Fei · Science Technology and Engineering · 2009
The traditional Shamir(k,n)threshold serect sharing scheme needs a lot of complex computation in the Galois field Fp.So it can not be used in the resource-restricted environment such as sensor-networks and RFID.To solve such problems,Y.Fujii and N.Hosaka et al,proposed a new(2,n)threshold secret sharing scheme which is much more efficient than Shamir's one.However,the secret share in their scheme can not be refreshed.With respect to this point,a new(2,n)threshold secret sharing scheme based on xor operation is proposed whose share can be refreshed in every new period.Because of good efficiency and key refreshment,our scheme is suitable to the resource-restricted environment such as sensor-networks,RFID cards and Smart carkds.