A {k, n}-secret sharing scheme for color images

Abstract

This paper introduces a new {k, n}-secret sharing scheme for color images. The proposed method encrypts the color image into n color shares. The secret information is recovered only if the k (or more) allowed shares are available for decryption. The proposed method utilizes the conventional {k, n}-secret sharing strategy by operating at the bit-levels of the decomposed color image. Modifying the spatial arrangements of the binary components, the method produces color shares with varied both the spectral characteristics among the RGB components and the spatial correlation between the neighboring color vectors. Since encryption is done in the decomposed binary domain, there is no obvious relationship in the RGB color domain between any two color shares or between the original color image and any of the n shares. This increases protection of the secret information. Inverse cryptographic processing of the shares must be realized in the decomposed binary domain and the procedure reveals the original color image with perfect reconstruction. © Springer-Verlag Berlin Heidelberg 2004.