Research On Image Secret Sharing Method With Essential Participants

The image secret sharing methods provide an effective way to solve the problems that the secret image information is easily lost and tampered while stored and transmitted in the network.The image secret sharing technology shares the secret image as multiple shadow images and distributes them to the corresponding participants.Only the participants in the qualified subset can cooperate to recover the original secret image,and the participants in the forbidden subset can not obtain anything about a secret image other than the secret image size.At present,there are mainly two kinds of research in image secret sharing: image secret sharing based on polynomials and image secret sharing based on visual cryptographic.The former can recover the secret image information precisely with the aid of the computing device.The latter has the advantage of simple decryption device,and the users do not need any knowledge of cryptography in the decryption process and can directly observe the decrypted image.Based on visual cryptography and polynomials-based image secret sharing methods,this dissertation studies the performance improvement of the image secret sharing scheme with essential participants.The main research works include:Firstly,a progressive visual sharing scheme((t,s,k,n)-ENVCS)with essential participants is proposed.The essential shadow image can replace the non-essential shadow image to reconstruct the secret image,and vice versa no.In this scheme,the construction of(t,s,k,n)-ENVCS is realized mainly by utilizing the idea of combining visual cryptography schemes.In contrast to other ENVCSs,this scheme is not just a general visual cryptography sharing scheme with essential participants,but also a progressive visual cryptography sharing scheme.Finally,parameters analysis and simulation experiments illustrate the feasibility of the scheme.Secondly,an improved image secret sharing scheme((t,s,k,n)-ESIS)with essential participants is proposed based on polynomial differential and Birkhoff interpolation.The sizes of all the shadow images in this scheme are reduced to 1 / k times of the secret image,and there is no concatenation of the sub-shadow images.In addition,this scheme has the optimal share ratios of shadow images,and the simulation results show that this scheme is effective and feasible.Finally,a new construction method of(t,k,n)-ESIS scheme is proposed based on modulo operation and XOR operation.All the shadow images in this scheme have the same size,and there is no concatenation of the sub-shadow images.Compared with the relevant schemes,this scheme is not a multiple SISs scheme,and the recovery process of the secret image is simpler,and it has a good sharing ratios of shadow images.Theoretical proofs and experimental results show the feasibility and effectiveness of this scheme.In summary,this paper studies the image secret sharing methods based on visual cryptography and polynomials,and achieves good results in improving the performance and visual quality of image secret sharing schemes with essential participants.Finally,the paper summarizes the research works,and on this basis,the future research works are prospected.