Visual secret sharing based on random grids with abilities of AND and XOR lossless recovery

In this paper, a visual secret image sharing threshold scheme based on random grids and Boolean operations with the abilities of AND and XOR decryptions is proposed. When no light-weight computation device the secret could be revealed by human visual system with no cryptographic computation based on Boolean AND operation (stacking). On the other hand, if the light-weight computation device is available the secret could be revealed with better visual quality based on Boolean AND or XOR operation and could be losslessly revealed when sufficient shadow images are collected for a general k out of n scheme. Furthermore, the proposed scheme has several superior performances such as (k, n) threshold, no codebook design, avoiding the pixel expansion problem and the same color representation as digital images (digital color). Experiments are conducted to show the security and efficiency of the proposed scheme. Comparisons with previous approaches show the advantages of the proposed scheme.