Improved multiple secret sharing using generalized chaotic image scrambling

Abstract

This paper presents a new technique on (n, n)-Multiple Secret Sharing (MSS) of color images. In this task, n shared images are generated from n secret images, while n recovered secret images can be reconstructed from n shared images. The proposed method employs the Chinese Remainder Theorem (CRT) and bitwise eXclusive-OR (XOR) operation for generating a set of shared image from a set of secret images. The proposed method improves the security level of (n, n)- MSS scheme by developing and utilizing the generalized chaotic image scrambling. This image scrambling effectively overcomes the problem on former existing MSS scheme while the number of secret images is odd number. As documented in experimental section, the proposed method offers a good result on (n, n)- MSS task. At the same time, the proposed method outperforms the former exising schemes in the MSS field.