Research On Secret Sharing Technique And Its Applications

In 1979,Shamir and Blakley proposed threshold secret sharing schemes independently,which can guarantee the security ancd integrity of the important information(such as secret key).Then,lots of reseachers conducted more in-depth study,and achieved lots of results.Now,secret sharing has become an important research direction in the domain of information security,and has been widely used in many fields.Based on Mignotte's secret sharing scheme,threshold changeable secret sharing scheme and the secret sharing scheme using key-lock-pair technique,we further analyze and research the secret sharing technology and its related applications.The detailed research results of this paper are as follows:(1)Using Mignotte secret sharing technique,we propose a verifiable e-voting scheme.By using mask code technique,our scheme can protect the privacy of the voting.By using secret sharing technique,our scheme allows voters to verify whole vote result,and can also balance the conflict of interest between privacy and accountability.In addition,our scheme can also balance participant's computational load,thus can void the overload of single point(such as counting center).Our scheme satisfy all feature requirement,and can resist potential attacks from malicious participants.(2)Based on Zhang et al.'s(t?t',n)and({r1,t2,...,tN},n)threshold changeable secret sharing schemes,we propose two improved schemes.By using threshold adjuster,our schemes can avoid the security risk that the dealer who hold the secret is always online.In addition,by using the two-variable one-way function,our schemes can risist the attack launched by the participants who have historical secret shadows,and require the shareholder to store only one secert shadow.Compared to Zhang et al.'s schemes,our schemes have following advantages:no limitation on the threshold values,less storage space requirement for secret shadows,less computation cost,shadow reusing and higher security.(3)Combined with Zhang et al.'s({t1,t2,...,IN},n)threshold changeable secret sharing scheme and Lin and Chan's secret image sharing scheme,we propose a secret image sharing scheme with threshold changeable capability.By preparing advance shares for potential changeable thresholds,the threshold can be adjusted in case of changes in.the security policy.By using the two-variable one-way function,our scheme can resist the attack launched by the participants who have historical secret shadows.The security analysis demonstrates our scheme can adjust threshold safely.In addition,the experiments show that the secret image can be recovered without distortion.(4)Based on key-lock-pair technique,we propose a multi-secret image sharing scheme which can recover the secret image without distortion.Our scheme can meet the requirements of complex application,because it is based on general access structure.By improving the construction method of target matrix and using public lock matrix,our scheme can reduce he volume of generated shadow.The security analysis demonstrates our scheme can share secret image safely.In addition,compared with other multi-secret image sharing schemes that based on general access structure,the experiments show that our scheme has better stego image quality.