• Jul 03, 2017 News!Good News! Since 2017, IJMLC has been indexed by Scopus!
  • Jul 06, 2017 News!Vol.7, No.2 has been published with online version.   [Click]
  • Jul 01, 2017 News!Vol.7, No.1 has been published with online version.   [Click]
Search
General Information
Editor-in-chief
Dr. Lin Huang
Metropolitan State University of Denver, USA
It's my honor to take on the position of editor in chief of IJMLC. We encourage authors to submit papers concerning any branch of machine learning and computing.
IJMLC 2014 Vol. 4(6): 522-526 ISSN: 2010-3700
DOI: 10.7763/IJMLC.2014.V6.466

Secret Image Sharing Schemes by Using Maximum Distance Separable Codes

Ching-Nung Yang, Chi-Le Hsieh, and Song-Ruei Cai
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).

[PDF]

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.

Copyright © 2008-2015. International Journal of Machine Learning and Computing. All rights reserved.
E-mail: ijmlc@ejournal.net