Proactive secret sharing scheme suitable for asymmetric secret sharing scheme
Naoto Kaneko, Keiichi Iwamura · 2016
An asymmetric secret sharing scheme (A-SSS) can set the number of servers at less than k, because it makes up to k-1 shares from one key of the owner of the secret. Therefore, the secret is not revealed even if all the servers are attacked. However, when the owner's key is stolen and attacked, shares may be leaked. Therefore, in this paper we propose a proactive secret sharing scheme suitable for an A-SSS. Our scheme realizes a reduction in the large volume of communications as compared with conventional proactive secret sharing schemes.