Multi Secret Image Sharing Scheme Research Articles

A novel approach for multilevel multi-secret image sharing scheme

Multi-secret sharing (MSS) is an effective technique that securely encodes multiple secrets to generate shares and distributes them among the participants in such a way that these shares can be used later to reconstruct the secrets. MSS schemes have a considerable advantage over the single-secret sharing schemes for secure multimedia data transmission. This paper presents a novel secret image sharing approach, namely ‘(n, m, l)-Multilevel Multi-Secret Image Sharing (MMSIS) scheme.’ The proposed MMSIS scheme encodes ‘n’ distinct secret images to generate ‘m’ shares and distributes them among ‘m’ participants allocated to ‘l’ distinct levels. The paper proposes two variants of the MMSIS scheme. The first variant is an $$(n,n+1,l)$$ -MMSIS scheme which encodes ‘n’ secret images each having a unique level id $$L_k$$ into $$(n+1)$$ shares. The image shares are then distributed among $$(n+1)$$ participants assigned to ‘ $$l=n$$ ’ different levels. With the increase in level id, the number of shares required to reconstruct the secret image also increases. To reconstruct a secret image of a particular level $$L_k$$ , all the shares at level $$L_k$$ and its preceding levels need to be acquired, which requires the consensus of all participants holding the shares up to level $$L_k$$ . The second variant, namely extended-MMSIS (EMMSIS) scheme is a generalized (n, m, l) version of the former scheme that allows to generate more shares for a specific secret image at a particular level in accordance with the consensus requirements for its reconstruction. The multilevel structure of the scheme makes it useful for multi-secret distribution in a multilevel organizational structure.

A (k, n) multi-secret image sharing scheme based on Chinese remainder theorem and Arnold cat map

A multi-secret image sharing (MSIS) scheme is a procedure to break down secret images into numerous shares and distribute each share to each authorized participant. Most existing ( n , n ) schemes face the problem of all-or-nothing that is all the n shares are required to reconstruct a secret image. If a single share is lost, then the secret image will not be recovered. Moreover, the existing ( k , n ) MSIS schemes either require k consecutive shares or general access structure to recover the secret images. The proposed scheme addresses the previous schemes’ issues. It is based on Arnold cat map, Chinese remainder theorem (CRT), and Boolean operation. It is a ( k , n ) threshold scheme where k is the threshold, and n is the number of participants. Arnold cat map is adopted for the randomization of images, and Boolean operation is used for producing public share images. CRT is utilized for the recovery of images. It has high fault tolerance capability as any of the k participants can submit their shares to reconstruct images and consume less computational time due to employing the modular method. Moreover, it can withstand differential as well as statistical attacks.

Multi Secret Image Sharing Scheme of General Access Structure with Meaningful Shares

A Multi Secret Image sharing scheme can share several secret images among certain participators securely. Boolean-based secret sharing schemes are one kind of secret sharing method with light-weighted computation compared to the previous complex algebraic-based methods, which can realize the sharing of multi secret images. However, the existing Boolean-based multi secret sharing schemes are mostly restricted to the particular case of (2, n) and (n, n), only few Boolean-based multi secret sharing schemes study the general access structure, and the shares are mostly meaningless. In this paper, a new Boolean-based multi secret sharing scheme with the general access structure is proposed. All the shares are meaningful, which can avoid attracting the attention of adversaries, and the secret images can be recovered in a lossless manner. The feasibility of the scheme is proven, the performance is validated by the experiments on the gray images, and the analysis of the comparison with other methods is also given out.

Multi-secret Image Sharing Scheme based on coding method

Image Secret sharing scheme is an effective way to share a secret message by distributing the shares to different owners which has become a relatively independent research field. The classical Shamir’s scheme is based on Lagrange interpolation polynomial, and the utility of the scheme is greatly compromised by the complex polynomial operations cost. Visual cryptography is a special image sharing scheme, which uses the human visual system to recover the secret information. Multi-secret shared visual cryptography is an important research part of visual cryptography. It can share several secret images, and have important significance for perfecting the theoretical system of visual cryptography and expanding the application fields of visual cryptography. In this paper, based on the research of the internal relations between the coding theory and the secret sharing, a Multi-secret Image Sharing scheme is proposed, the generation of the shares is realized by the binary Cauchy encoding. It satisfies the general characters of the secret image sharing schemes, and the algorithm complexity is low, which is easy for implementation.

A new multi-secret image sharing scheme based on DCT

Multi-secret image sharing scheme (MSIS) is a technique to share multiple secret images over the internet. Normally, most of the secret image sharing schemes can share only a single secret image. However, due to the rapid development of internet technology, the necessity of sharing multiple images arises. An (n, n) MSIS is employed to share n images to n authorized participants. All the n participants are required to submit their respective shares to recover the original secret images. If the number of the participants is less than n, then reconstruction of the secret images is impossible. Most of the existing schemes which are in the frequency domain do not have the capability to handle multiple secret images. In this paper, a MSIS that uses the Discrete Cosine Transform is proposed to overcome the limitation present in the existing schemes. Moreover, the proposed scheme requires less computational time than the existing schemes. Security of the proposed scheme is analyzed and shows that the proposed scheme is computationally secure. Also, the proposed scheme can recover the same original secret images.

Universal Share for Multisecret Image Sharing Scheme Based on Boolean Operation

Conventional secret sharing schemes require complex computation. Visual secret sharing (VSS) scheme encrypts a secret into two or more meaningless images, called as shares. Shares are stacked together to decrypt a secret using human visual system. In recent years, concept of universal share is introduced to share multiple gray images. A company organizer uses this unique share to recover multiple images. However, utilization of complex numerical computation makes such system inappropriate for VSS. In this letter, we overcome this complexity issue and propose a Boolean-based light-weight computation scheme to share multiple secrets using universal share. The proposed Boolean-based multisecret sharing (MSS) scheme encodes n secret images into a universal share and n meaningless shares, and reconstructs lossless secret images. To provide threshold security, the proposed scheme uses random universal share generating function to generate a distinct universal share from base universal share for each secret image. Moreover, to enhance limited sharing capacity of the Boolean-based MSS scheme, we propose a modified Boolean-based MSS scheme.

Enhanced Multi Secret Image Sharing Scheme for Gray and RGB Images

Enhanced Multi Secret Image Sharing Scheme for Gray and RGB Images

Secure (n, n + 1)-Multi Secret Image Sharing Scheme Using Additive Modulo

Multi Secret Image Sharing (MSIS) scheme is a protected method to transmit more than one secret images over a communication channel. Conventionally, only single secret image is shared over a channel at a time. But as technology grew up, there arises a need for sharing more than one secret image. An (n, n)-MSIS scheme is used to encrypt n secret images into n meaningless noisy images that are stored over different servers. To recover n secret images all n noise images are required. At earlier time, the main problem with secret sharing schemes was that one can partially figure out secret images by getting access of n – 1 or fewer noisy images. Due to this, there arises a need of secure MSIS scheme so that by using less than n noisy images no information can be retrieved. In this paper, we propose secure (n, n + 1)-MSIS scheme using additive modulo operation for grayscale and colored images. The experimental results show that the proposed scheme is highly secured and altering of noisy images will not reveal any partial information about secret images. The proposed (n, n + 1)-MSIS scheme outperforms the existing MSIS schemes in terms of security.

Enhanced Boolean-based multi secret image sharing scheme

Recently, Chen and Wu propose a (n, n) multi secret image sharing (MSIS) scheme that shares n secret images into n shared images. These n shared images can be together used for reconstructing n secret images by Boolean operations. However, there is an inaccuracy in Chen and Wu's (n, n)-MSIS scheme that one can recover some secret images (partial secret information) from (n−1) or fewer shared images. This compromises the threshold security in (n, n)-MSIS scheme. In this paper, we overcome this inaccuracy and propose a strong threshold (n, n)-MSIS scheme without leaking partial secret information from (n−1) or fewer shared images. Moreover, by an inherent property of image that a permutated image with a chaotic reallocation of pixels without effect on their intensity levels, we propose a modified strong (n, n)-MSIS scheme to further enhance the randomness of shared images.