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.

A Common General Access Structure Construction Approach in Secret Image Sharing

(k, n) threshold is a special case of the general access structure (GAS) in secret image sharing (SIS), therefore GAS is more extensive than (k, n) threshold. Most of conventional SIS, including visual secret sharing (VSS), polynomial-based SIS, linear congruence (LC)-based SIS, etc., were proposed with only (k, k) threshold or (k, n) threshold other than GAS. This article introduces a common GAS construction approach in SIS with on pixel expansion from existing (k, k) threshold or (k, n) threshold SIS. The authors input classic SIS methods to test the efficiency and feasibility of the proposed common GAS construction approach. Experiments are presented to indicate the efficiency of the approach by illustrations and analysis.

Major Developments in Visual Cryptography

Visual cryptography is a cryptographic mechanism that gets applied in visual information protection for secured transfer of data. The encryption makes the decryption a mechanical operation.The secret image gets converted into several share images. The share images are distorted/ noisy images which will give the correct image only when placed in the right combination. This paper reviews various visual encryption and decryption mechanism with the safe transmission of information from the literature. This paper about visual cryptography discusses, general access structure, halftone, colour, progressive, region incrementing, extended visual cryptography, colour extended visual cryptography, XOR and OR visual cryptography and the applications of visual cryptography. The applications discussed here are banking security, steganography, crime records, intelligence communication, multilayered Id cards and fingerprint records. The paper provides an overview of advances in VCS where each technique overcomes the problem(s) faced in the other manner.

Image Secret Sharing Construction for General Access Structure with Meaningful Share

This article describes how the (k, n) threshold image secret sharing technology can recover the secret image even n − k shares are lost, or n−k servers do not work, which is useful for cloud storage, etc. Image secret sharing for general access structure (GAS) is more general than (k, n) threshold. Image secret sharing with a meaningful share will decrease encryption suspicion so that the security can be enhanced. However, traditional studies have no image secret sharing construction approach for GAS with a meaningful share. In the article, they first exploit an image secret sharing construction approach for GAS with meaningful share. Following their construction approach, the authors develop a random grid (RG)-based visual secret sharing (VSS) algorithm for GAS with meaningful share as well as polynomial-based image secret sharing for GAS with meaningful share. The experiments with this concept exhibit the effectiveness of the algorithms and further their construction approach.