基于异或运算的份额可更新(2,n)门限秘密共享方案

New(2,n)Threshold Secret Sharing Scheme with Share Refreshing Based on XOR Operations

传统的Shamir(k,n)门限秘密共享方案,需要复杂的Galois域Fp中的大量运算,效率较低,不能适应传感器网络、RFID等资源受限的应用环境。为了解决这个问题,Y.Fujii和N.Hosaka等人提出了一种基于纯粹异或运算的(2,n)门限秘密共享方案。该方案效率较Shamir方案有很大提高,但是该方案的秘密份额不具备定期更新性。针对这一问题,提出了一种基于异或运算的可更新门限秘密共享方案,兼具效率较高和份额定期更新的特点,特别适合传感器网络、射频卡、Smart卡等资源紧张的安全环境。

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.