Visual cryptography

About: Visual cryptography is a research topic. Over the lifetime, 1724 publications have been published within this topic receiving 25300 citations.

Secure Data Hiding Based on Most Significant Bit Error Prediction Mechanism using Blow Fish Algorithm

Abstract: In this research module, a transportation builds in the digital image and communication stage of network safety process which is dependable to face the profitable and non-commercial IT expansion communities of data streams in high dimensional data group modeling. Reversible data hiding in encrypted images is one of the schemes that can be used for secrets to hide the image when we transfer the image through a network. The method RDHE is used to encrypt a furtive image or file by flouting into shares. To take the gain of these goods, the third person can recover the furtive image if they sharing a furtive image are transmitted through the network. This module presents a model within reach of to encrypt generated image shares of Visual Cryptography using Public key Encryption. We used BlowFish algorithm in order to provide the dual security of the file. Those who make the fake creation of data while transferring the furtive image, the image which can send through the network which is furtive to the third person. The proposed method provides shares that are more furtive and robust beside amount of crisis. This method provides more furtive for images, documentation and hand written files, etc. This method mostly executes in public networks. The simulation tool used for this research module is MATLAB.

Improved scheme and evaluation method for progressive visual cryptography

Abstract: Abstract Visual cryptography (VC) is a powerful technique with high security and requires no PC or device to reconstruct the secret information. Progressive visual cryptography (PVC) is a variation of the VC scheme in which the quality of the reconstructed image is improved by increasing the number of shared images. The previous study focused directly on maximizing the value of the quality in the completely reconstructed image; thus, there is a difference in the quality of the shared images. In this paper, we focus on the aforementioned issue and propose a new approach based on inductive reasoning. Our basic idea is to maximize the quality of the reconstructed images each time the number of shared images increases. We call this method the bottom-up approach . Moreover, hitherto, PVC has been evaluated based on the value of relative difference or by sight. Such evaluation methods are only subjective or difficult to execute without the knowledge of basis matrices. In addition, PVC users cannot easily confirm the effectiveness of their shared images. In this paper, we propose a new information-theoretic evaluation method for PVC, which only uses shared images, to solve the aforementioned problems. Our proposed method can objectively and quantitatively evaluate PVC based on the numerical value, and PVC users can easily confirm the effectiveness of their shared images.

Boolean-based Two-in-One Secret Image Sharing by Adaptive Pixel Grouping

Abstract: The two-in-one secret image sharing (TiOSIS) technique is a hybrid scheme that protects a secret image by combining visual cryptography (VCS) and polynomial-based secret image sharing (PSIS). There are two decoding methods available in TiOSIS: stacking-to-see decryption and lossless image recovery. However, the majority of current TiOSIS methods use Lagrange interpolation to precisely reconstruct the secret, which would result in intense computations. In this article, an efficient TiOSIS scheme using Boolean XOR operation for lossless image recovery is proposed. The proposed scheme consists of three building blocks: shared data generation, shadow construction, and image decryption. In shared data generation, the grayscale secret image is processed by a Boolean-based SIS to derive the shared bits. In shadow construction, an adaptive pixel grouping (APG) strategy is utilized to determine a grouping pattern. The halftone image adjustment algorithm is adopted to generate a suitable halftone image. With the grouping pattern and halftone image, we construct the shadows via the group-pixel embedding and sharing approach. In image decryption, we can reveal the secret image by stacking-to-see decoding or Boolean-based lossless image recovery. Extensive experiments and comparisons are illustrated to show the effectiveness and benefits of the proposed scheme.

Visual cryptography applied to fingerprint features as a solution for pre-alignment.

Abstract: Visual cryptography enables to derive from an image two shares that give separately no information on the original image while leading back to the image by superimposition of the shares. In this work, we apply this technique to fingerprint features for enabling an alignment of a reference and a fresh images. The idea is to use an encrypted share derived from the reference data as a kind of reference grid for pre-alignment of the fresh data on it. Following the principle of visual cryptography, it also ensures a storage protection when data are stored in separate locations.

Private Data Distribution Using Visual Secret Sharing Scheme

Abstract: Data securing is one of the major issue in the computer world. Visual secret sharing is the technique which divides the image into n number of multiple shares. Each share constitutes some data and when k shares out of n mass with one top of another together the secret will give knowledge of that data. However, less than k shares will not work. Decryption process is the resplendency of the visual secret sharing scheme i.e. decryption process of secret takes place using Human Visual System (HVS) without using any computation and calculation. The obtained secret recuperate through this design is twice in size of the pristine secret. Steganography is the art of transferring the information using original files in unknown pattern. In our approach we have recommended the incipient algorithms for the (2, 2) visual cryptography, visual secret sharing and steganography process which includes LSB (Least Significant Bit) is essential for data hiding. Our proposed approach is for gray scale image and by putting one on top another shares; the outcome is achieved in same size with pristine secret image and its shades and shared over the network, hidden data will be obtained in original format. Randomization and pixel reversal approach is being used in all methods.