A Secret Image Restoring Scheme Using Threshold Pairs of Unordered Image Shares

Secret image sharing has been widely used in numerous areas such as remote sensing and information security. The goal is to share and recover one or more images using several image shares. However, most schemes only consider ordered shares. In addition, the dependency between the images and the share is determined, that is, which image the share belongs to is determined. In this paper, by using the generalized Chinese remainder theorem method, we propose a secret image sharing scheme using threshold pairs of unordered image shares, where t out of n share pairs are needed to recover the original secret images, even if the affiliation between the shares and the images is disturbed. Compared with existing schemes, the proposed sharing algorithm is more secure and the recovery algorithm is more effective. Moreover, the conditions for the success or failure of recovering two images from their unordered shares are obtained. Simulations are also presented to show the efficiency of the proposed algorithms.