New Construction Of Threshold Secret Sharing Scheme

Secret sharing scheme provides an effective method for information security and data privacy.It is a very important branch of modern cryptography and an important part of information security.In n)secret sharing scheme,any m(?t)out of n users can reconstruct secret but any t-1 or fewer person cannot get hold of any valuable information of the secret even if they use their shares.However,some cheaters can submit fake shares to fool other honest users during secret reconstruction,so that the secret is kept exclusively by cheaters,while the honest users cannot get the right secret.In this dissertation,we mainly study the following main content.(1)We present a novel(n,n)threshold multi-secret sharing shame based on the error correcting capacity of Hamming codes.In this scheme,The secrets are codewords in the Hamming code.The mastery of secret shares is given to each group by grouping participants,therefore,reconstructing the secret requires all groups to provide their correct secret shares.This scheme can verify the validation of the secret share between the participants by using two variable one-way function and membership verification.(2)We propose a cheating identifiable multi-secret sharing scheme.A bivariate polynomial is used to generate k secrets and establish pairwise secret keys between groups to prevent outsiders.Utilizing the characteristic that the characteristic equation of the matrix of order n have multiple roots,the cheating identification is constructed in the black box to identify and eliminate cheaters.Compared with the existing most secret sharing schemes,the uniqueness of this scheme lies in that the participants cannot directly own secret shares.Only the participants verified as honest by the black box can obtain secret shares encrypted by secret keys,and then reconstruct secrets by decryption and calculation.Analysis results show that the scheme can protect secrets against both inside and outside adversaries.