Chinese remainder theorem-based two-in-one image secret sharing with three decoding options

Abstract

Two-in-one image secret sharing (ISS) with more decoding options has more applicable scenarios than that with only one decoding option. Conventional two-in-one ISS methods with more decoding options mainly combine visual secret sharing (VSS) and polynomial-based or XOR-based ISS. They have the drawbacks of lossy recovery for (k,n) threshold, only two decoding options, high computation in recovering phase or large pixel expansion. In this article, we design a Chinese remainder theorem (CRT)-based two-in-one ISS with three decoding options: lossless recovery, grayscale stacking recovery and visual previewing capability. In the encoding phase, we encode a binary secret image by random grid (RG)-based VSS (RGVSS). Meanwhile, a grayscale secret image is encoded by CRT in the processing of encoding the binary secret image. In the decoding phase, we can decode the binary secret image with two decoding options: grayscale stacking recovery and visual previewing capability. The grayscale secret image can be losslessly decoded with one decoding option through solving a set of linear congruence equations with only modular operation. Furthermore, the shadow image has no pixel expansion. We show our effectiveness by means of theoretical analyses and experiments.