Secret image sharing is a hot issue in the research field of data hiding schemes for digital images. This paper proposes a general k,n threshold secret image sharing scheme, which distributes secret data into n meaningful image shadows based on a non-full rank linear model. The image shadows are indistinguishable from their corresponding distinct cover images. Any k combination of the n shares can perfectly restore the secret data. In the proposed scheme, the integer parameters k,n, with k≤n, can be set arbitrarily to meet the application requirement. The experimental results demonstrate the applicability of the proposed general scheme. The embedding capacity, the visual quality of image shadows, and the security level are satisfactory.

/pdf/a-k-n-threshold-secret-image-sharing-scheme-based-on-a-non-2dltboef.pdf

A k,n-Threshold Secret Image Sharing Scheme Based on a Non-Full Rank Linear Model

Secret image sharing by using multi-prime modular arithmetic

This article proposes an efficient XOR-based visual cryptography scheme with lossless reconfigurable algorithms, which includes an encryption and a decryption schemes for gray-scale and color secret images. The encryption scheme aims to encrypt secret images by mapping them to several shared images that do not suffer any pixel expansion problem and do not reveal any information of the secret images by considering a random column selection algorithm based on the 0-mapping and 1-mapping matrices, where the two matrices are dynamically generated in the encryption scheme. Moreover, the proposed decryption scheme can reconstruct the secret images with only a series of XOR operations. The reconstructed images do not suffer any contrast distortion and pixel expansion problems comparing with their original secret images. Finally, the proposed two schemes are illustrated with the practical examples.

Xuehu Yan

Papers

Multiparty Verification in Image Secret Sharing