An Efficient Proactive Share Refreshing Scheme for Secret Sharing in Distributed Systems

In this paper, we propose a proactive share refreshing scheme for secret share in a distributed system. It enjoys a strong secrecy property against both static and adaptive adversaries. It employs bit commitment technique to make the refreshing process efficient, and the key refreshing cost is less than 50% of the key generation time with key length at 163 bits while the public key is kept intact after share refreshing, which is a nice features of our scheme.