Abstract
In recent years, various secret sharing schemes for digital images have been developed in order to promote communication security. Previous methods in the literature have made efforts to achieve the merits properties for a good secret image sharing scheme such as implement (k, n)threshold, simple recovery, no pixel expansion, the generated shadow images are meaningful, the order of shadow images is alternative and lossless recovery of the secret image. To the best of our knowledge, no previous secret sharing scheme achieves all the above properties with good quality of meaningful shadow images. In this paper, we propose two different secret image sharing schemes, (n(1), n(1)) and (k, n(2)) thresholds, based on information hiding theory to improve the quality of meaningful shadow images with lower computation and good expansibility. In addition, the proposed schemes have the advantages of lossless and alternative order recovery and no pixel expansion. Comparisons with previous approaches show the performance of the proposed schemes.