In this paper, we propose a fault-tolerant secret image sharing scheme based on vector quantization (VQ). The proposed method uses some of the n host images to generate the codebooks for VQ, and compresses the secret image by VQ with the generated codebooks. The VQ indices are thus created and then shared among n shadows. After obtaining the n shadows, they are embedded together with the mixed information of the generated codebooks into the n host images to form the n stego-images. When collecting any r (r ≤ n) of the n stego-images, the VQ indices and codebooks can be retrieved to recover the secret image. However, no information about the secret image can be revealed if obtaining less than r stego-images. Because of using VQ, the secret image is compressed to the VQ indices, and thus easier to be hidden than the non-compressed one. The quality of the recovered image is the same as the one of the ordinary VQ. Key-words: fault-tolerant, secret sharing, vector quantization, data hiding.
[1]
Chang-Chou Lin,et al.
Secret image sharing with capability of share data reduction
,
2003
.
[2]
Ja-Chen Lin,et al.
Sharing secret images by using base-transform and small-size host images
,
2006
.
[3]
R. Gray,et al.
Vector quantization
,
1984,
IEEE ASSP Magazine.
[4]
Chin-Chen Chang,et al.
New method of secret image sharing based upon vector quantization
,
2001,
J. Electronic Imaging.
[5]
Ja-Chen Lin,et al.
Secret image sharing
,
2002,
Comput. Graph..
[6]
Adi Shamir,et al.
How to share a secret
,
1979,
CACM.
[7]
Ran-Zan Wang,et al.
Secret image sharing with smaller shadow images
,
2006,
Pattern Recognit. Lett..
[8]
Chin-Chen Chang,et al.
Sharing Secret Omages using Shadow Codebooks
,
1998,
Inf. Sci..
[9]
G. R. BLAKLEY.
Safeguarding cryptographic keys
,
1979,
1979 International Workshop on Managing Requirements Knowledge (MARK).