Design And Analysis On Two Kinds Of Non-Permutated Image Secret Sharing Scheme

Image secret sharing was proposed in1994by Naor and Shamir for the first time, it has become one branch of secret sharing application, and usually used to transmit information on medicine, architectural design and military over the network. Firstly, We have summarized the previous literatures on image secret sharing scheme, and have analyzed some typical image secret sharing schemes. Secondly, For that most of image secret sharing schemes need to be permutated, two kinds of non-permutated image secret sharing schemes are proposed. Finally, two kinds of parallel algorithms to be designed respectively on states that the number of participants is too big or image scale is too large. The related works are as follows:1. Designed and implemented a non-permutated image secret sharing scheme with contour security. The t-order polynomial is adopted both during image sharing and recovery, and the coefficient of t-order is an integer randomly selected by the secret dealer. Besides, the threshold scheme of Shamir (t, n) has been used twice during image sharing, one for sharing parameters, and the other for sharing image. As the result, it has enhanced the security of the scheme. This scheme is a (t, n) threshold scheme, the compression ratio of shadow is near to1/t, and it meets the contour security that whenever the number of participants is less than t, they can’t collude to reconstruct the original image or its contour.2. Designed and implemented a non-permutated image secret sharing scheme based on the participants’weight. The binomial theorem is used to share original image at the stage of distribution. Meanwhile, the two-variable one-way function is used to split the original image pixels and avoid the permutated process. Besides, the Q-value method is introduced to make it that the higher of participants’weight is, the greater amount of information will be received, but the shadow image held by each participant are of the same size. This scheme is a (n, n) threshold scheme, the compression ratio of shadow is near to1, and it also meets contour security. 3. In view of states that there are too many participants or image scale is too large, designed two kinds of parallel algorithms of peer-to-peer model. Experimental results show that when there are too many participants or image scale is too large, the parallel algorithm can effectively reduce the sharing time.