An Information Hiding Scheme Based on Chinese Remainder Theorem

The combination of steganography and secret image sharing (SIS) is an important aspect of information hiding. The two techniques are usually separate phases in one combination. A novel behavior steganography model was recently put forward to achieve the true fusion. However, the polynomial-based (k, n.) threshold SIS scheme based on the model is confront with some inevitable weaknesses, including auxiliary encryption, lossy recovery, and complex recovery computation. In this paper, a scheme based on Chinese remainder theorem-bawd secret image sharing of (k, n) threshold ((k,n) - CRTSIS) is proposed. The number of bits chosen from secret message to embed in SIS is determined by the interval range of the random parameter in (k, n) - CRTSIS. As a result, the proposed scheme realizes not only the (k, n) threshold, but also lossless recovery and low computation complexity without auxiliary encryption. Analysis and experiments are provided to indicate the effectiveness of the proposed scheme.