Research On Key Technologies Of Lossless Secret Image Sharing

In the age of network technology,the protection of secret image information is par-ticularly important.Secret image sharing is an image protection technology with tolerance for data corruption or loss.Different application scenarios have different requirements on the functional attributes of secret image sharing.Each functional attribute corresponds to one or more key technologies.In some application scenarios,the high quality of image restoration is required,so that it is necessary to recover the original secret image loss-lessly,and at the same time,other functional attributes are required.In this paper,three kinds of lossless recovery polynomial-based secret image sharing schemes are proposed for the disadvantages of secret image sharing,such as lossless recovery,low efficiency of color image sharing,and non-differentiated importance of shadow image.The main work of this paper is as follows:(1)In order to solve the problem of low efficiency in color image sharing,an efficient lossless polynomial secret color image sharing algorithm is proposed.In this algorithm,three RGB components of color image pixel are shared as a single secret value,which improves the sharing efficiency of color image.And the lossless recovery of color image is realized by changing the finite field to GF(16777259)and using the filter operation.(2)Aiming at the deficiency of the existing algorithm shadow image does not distin-guish the importance,a secret image sharing algorithm with different weights is proposed by probability allocation of shadow pixels.And the lossless recovery of grayscale image is realized by changing the finite field to GF(257)and using the filter operation.(3)Aiming at the problem of mismatch between the space of the prime-number field of traditional polynomial secret image sharing operation and the value space of image pixel,the perfect lossless recovery under GF(2~8)in the finite field is designed,and the efficiency of multiplication and division under GF(2~8)in the finite field is improved by the table lookup method.