Abstract—A well-known polynomial-based (k, n) secret image
sharing (SIS) scheme is to share a secret image into n noise-like
shadow images, and the secret image can be recovered from any
k shadow images. In this polynomial-based (k, n)-SIS scheme,
the pixels of the secret image should be permuted to achieve the
randomness of shadow images. If we do not permute secret
image, there will be a problem of remanent secret image on
shadow images. However, if we use a key to permute secret
image then we need keeping this permutation key in advance or
sharing it among all participants. In this paper, we adopt Reed
Solomon code, a maximum distance separable code, to propose a
(k, n)-SIS scheme. Our (k, n)-SIS scheme solves the problem of
remanent secret image on shadows, and does not need
permuting secret image. Meantime, we can reduce the shadow
size like polynomial-based (k, n)-SIS that reduces shadow size to
1/k of secret image size.
Index Terms—Secret sharing, secret image sharing, Reed Solomon (RS) code, maximum distance separable (MDS) code.
C. N. Yang, C. L. Hsieh, and S. R. Cai are with the CSIE Dept., National Dong Hwa University, Hualien, Taiwan (corresponding author: C. N. Yang; e-mail: cnyang@ mail.ndhu.edu.tw).
Cite: Ching-Nung Yang, Chi-Le Hsieh, and Song-Ruei Cai, "Secret Image Sharing Schemes by Using Maximum Distance Separable Codes," International Journal of Machine Learning and Computing vol. 4, no. 6, pp. 522-526, 2014.