| In the classical secret-sharing scheme,it is usually assumed that the adversary will be able to obtain the whole shares of an unauthorized set,and learns no information about the secret.However,in some practical applications,the adversary may get some partial information of other shares through the side-channel attacks,which will be used to attack the scheme together with the previous shares of the unauthorized set.Therefore,the secret sharing that can resist side-channel attacks has aroused the attention of scholars,and this type of secret sharing is called leakage-resilient secret sharing.In this paper,we consider the constructor method of leakage-resilient secret sharing from the aspects of leakage-resilient secret sharing model,leakage rate,and security type.this paper proposes a leakage-resilient secret sharing construction method based on physically unclonable Functions(PUF),fuzzy extractors(FE),and a leakage-resilient secret sharing construction method with all-or-nothing transforms(ANOT).The first construction method is applied to the secret sharing scheme that can register new participants,and the secret sharing scheme that can not only resist leakage but also efficiently register new participants can be obtained.The main achievements of this paper are in the following three aspects:(1)Based on the two tools of physical unclonable functions and fuzzy extractors,this paper proposes a constructor that converts the secret sharing scheme of any general access structure into a memory leakage-resilient secret sharing scheme(MLRSS),which can resist memory leakage attacks.In a memory leak attack,the adversary can obtain not only all the information of the shares in the unauthorized set,but also some part of the remaining shares.The leakage rate of such schemes can reach 1.In this paper,the hybrid method strictly proves that such schemes are statistical security.(2)Based on the existing statistically secure leakage-resilient secret sharing definition,the definition of local leakage-resilient secret sharing(LLRSS)is given as perfect security.Through the perfect security AONT tool,a construction method for transforming the secret sharing scheme of the threshold structure into a perfectly secure LLRSS scheme is proposed.(3)A secret sharing scheme is designed that can efficiently register new participants based on the threshold secret sharing scheme of Asmuth and Bloom.In the process of registering new participants to the scheme,the original participants do not need to communicate with each other,nor do they change or leak the original shares.Combined with the constructor of the MLRSS scheme,a secret sharing scheme with both memory leakage-resilient ability and efficient register of new participants is obtained. |