Secret Sharing with Chaotic-Based Bit Permutation

This paper proposes a new method on Multiple Secret Sharing (MSS) for color images using chaotic-based bit permutation. This paper overcomes the limitation of former existing MSS scheme while the number of secret images is an odd number. The proposed method firstly scrambles a set of secret images with chaotic-based bit permutation and generates a set of shared images in even number. This scheme effectively solves the asymmetric problem on MSS and, in the same time, it offers higher security level compared to that of the former method. As documented in experimental, the proposed method yields a promising result on MSS task for color images.