Multiple Secret Sharing with Simple Image Encryption

Heri Prasetyo,
Chih-Hsien Hsia,
Jing-Yi Deng,


Multiple Secret Sharing (MSS) aims to secure the image transmission by improving the ambiguity on image contents. The former ( n , n )-MSS scheme generates n shared images from n secret images and reconstruct n recovered secret images from n shared images. This scheme hides the content of secret image by performing the eXclusive-OR (XOR) with specific masking coefficient. It exploits the Chinese Remainder Theorem (CRT) approach for generating the masking coefficient. However, the former scheme cannot work if n is odd. It overcomes the aforementioned problem by incorporating random image, transforming into nk encrypted secret images, and employing double masking coefficients. The presented MSS scheme utilizes an image encryption technique with simple chaotic maps for increasing the ambiguity of shared image content. The experimental results reveal that the proposed MSS method solves the problem on former MSS scheme and yields better performances.

Citation Format:
Heri Prasetyo, Chih-Hsien Hsia, Jing-Yi Deng, "Multiple Secret Sharing with Simple Image Encryption," Journal of Internet Technology, vol. 21, no. 2 , pp. 323-341, Mar. 2020.

Full Text:



  • There are currently no refbacks.

Published by Executive Committee, Taiwan Academic Network, Ministry of Education, Taipei, Taiwan, R.O.C
JIT Editorial Office, Office of Library and Information Services, National Dong Hwa University
No. 1, Sec. 2, Da Hsueh Rd., Shoufeng, Hualien 974301, Taiwan, R.O.C.
Tel: +886-3-931-7314  E-mail: