No abstract

This paper presents a novel highly efficient secret image sharing scheme that is symmetric, Boolean-based, secure, and enables multi-secret image sharing. The proposed (n, n) scheme involves sharing n secret images among n shared images and recovers all n secret images from n shared images, and losing any shared image prevents recovering any secret image. We propose a novel symmetric sharing-recovery function (SSRF) for performing sharing and recovery. The scheme is based on Boolean operations to attain low computational complexity and is more secure than previous Boolean-based schemes; it exhibits more randomness in each shared image, more randomness between two or more shared images, and higher shared image sensitivity. The experimental results showed that a similar CPU computation time is required for both generating shared images from secret images, and recovering secret images from shared images. Furthermore, the computation time of the SSRF is proportional to the number of secret images.