Robust Secret Image Sharing Based on Robust Chinese Reminder Theorem

Abstract

In a $(k,\ n)$ threshold secret image sharing (SIS) scheme, the original secret image can be reconstructed losslessly by collecting no less than $k$ shadow images without errors. However, during the transmission or storage of the shadow image, if the transmission channel is noisy or the storage medium is unreliable, the shadow images will be erroneous. In this case, most of the existing SIS schemes cannot reconstruct the secret image. In an effort to cope with the issue, we propose a robust SIS (RSIS) scheme based on the Robust Chinese Remainder Theorem (RCRT), namely RSIS-RCRT, which can realize the reconstruction of the secret image with high quality under a certain error in the shadow image. In addition, a simple and effective Image Correction Method (ICM) is proposed, which improves the quality of the reconstructed image significantly in RSIS-RCRT scheme. Experiments show that the RSIS-RCRT scheme and ICM are effective.