Research Of Secret Sharing Schemes In The Presence Of Leakage

With the development of the internet technology, there are a profound impact on the world. The new technologies are not only changing our life, but also bringing some challenges. For achieving benefit, the new technologies may be used to commit some crimes by the lawbreakers, such as side-channel attack which can make the key exposure problems by detection of the power consumption, frequency and time of the execution of the encryption devices. To solve the problems of the conduction and leakage of the secret keys, the skills of the leakage-resilient and the secret schemes(SS) are the main way. Thus, the paper presents the sample and efficient secret sharing schemes with leakage-resilient so as to solve the leakage problems and improve the security and flexibility of the secret sharing schemes.Firstly, to solve the leakage problems of the semi-honest distributors on the secret sharing schemes based on the shamir’s threshold secret sharing scheme, this paper presents a new leakage-resilient verifiable multi-secret sharing scheme. The scheme is effectively preventing from leaking secret information by selecting and constructing the polynomial coefficients by all of participants, instead of randomly selecting by the semi-honest distributor. Moreover, the scheme can verify the efficient of secret shadows and have better efficiency in terms of computation time.Secondly, to achieve all the participants with weighted and change the secret with dynamic, the paper proposes a leakage-resilient dynamic and verifiable multi-secret sharing scheme with weighted. Similar to the above scheme, this scheme also can prevent from leaking the secret information, then it has better security than before. To improve the practicality of the secret sharing scheme and make the participants have different weight, this scheme divides a polynomial by using Chinese Remainder Theorem(CRT) for secret sharing Besides the scheme increases the flexibility of the SS and achieves dynamic update secret and the numbers of the participants by updating some verifiable secret shadows by the distributor.In addition, to deal with the leakage problems from the secret shadows at SS, this paper puts forward a strongly leakage-resilient and dynamic secret sharing scheme to achieve the unconditional security. the scheme introduces two notions of information transfer ring and interpolation components to effectively improve the secrecy of the shares and increase the reusability of the secret shadows; the scheme is secure in the presence of unbounded adversary and thus is unconditionally secure. the scheme provides a mechanism to dynamically update the secret without jointly updating the shares,and thus is dynamic; the paper, defining the concepts of a largest leakage rate and strongly leakage-resilient, can be used as a standard to evaluate the strength of the Leakage-resilient.