Highly efficient and secure multi-secret image sharing scheme

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.

XOR-Based Progressively Secret Image Sharing

“…Section 2.2 introduces the method proposed by Chen and Wu [16]. Section 2.3 introduces the method proposed by Chen et al [17].…”

“…Since the random image does not need to be shared as shared images, the sharing capacity is increased. Chen et al [17] proposed a method that also used the random number image generation function to generate images containing random noise but will perform further bit shift processing on the generated random images. Kabirirad and Eslami [18] proposed a multi secret image sharing scheme based on Boolean operations.…”

“…The paper is organized into the following sections. Section 2 gives a brief review of related works [15][16][17]. Section 3 presents details of the proposed sharing and recovery approach.…”

“…Using Equation (17), n random images R 0 -R n−1 are generated by n secret images performing bit shifting, where x, y represents the pixel positions in the image;…”

Advanced Color Covert Image Sharing Using Arnold Cat Map and Visual Cryptography

“…Shares are generated by using the Pseudo randomized VC technique that involves the following steps [18], [19] Input: Encrypted image F Output: Share1, Share2…”