Abstract—In this paper, we propose a new visual secret
sharing scheme which is suitable for grayscale images. The
proposed scheme achieves the following objectives. First, it
satisfies four general criteria of visual secret sharing systems:
security, accuracy, small shadow size and low computation cost.
Second, the scheme can successfully reconstruct the secret image
exactly. Finally, the decoding cost of our proposed scheme is
much less than that required by other previously proposed
schemes. Therefore, our proposed scheme is suitable for
real-time applications.
Index Terms—Secret sharing, Sudoku, meaningful,
searching.
C. C. Chang was with the Department of Computer Science and
Information Engineering, Asia University, No. 500, Lioufeng Rd., Wufeng,
Taichung, 41354, Taiwan. He is now with the Department of Information
Engineering and Computer Science, Feng Chia University, No. 100,
Wenhwa Rd., Seatwen, Taichung, 40724, Taiwan (corresponding author;
e-mail: alan3c@gmail.com; tel.:+886-4-24517250 ext. 3790).
N. T. Huynh and T. F. Chung were with the Department of Information
Engineering and Computer Science, Feng Chia University, No. 100,
Wenhwa Rd., Seatwen, Taichung, 40724, Taiwan (e-mail:
ngoctu84vn@gmail.com, carter629629@gmail.com).
Cite: Chin-Chen Chang, Ngoc-Tu Huynh, and Ting-Feng Chung, "Efficient Searching Strategy for Secret Image Sharing with Meaningful Shadows," International Journal of Machine Learning and Computing vol. 4, no. 5, pp. 423-427, 2014.