Text image secret sharing with hiding based on color feature

The Secret Sharing is a scheme for sharing data into n pieces using (k, n) threshold method. Secret Sharing becomes an efficient method to ensure secure data transmission. Some visual cryptography techniques don’t guarantee security transmission because the secret information can be retrieved if the hackers obtain the number of shares. This study present a secret sharing method with hiding based on YCbCr color space. The proposed method is based on hiding the secret text file or image into a number of the cover image. The proposed method passes through three main steps: the first is to convert the secret text file or image and all cover images from RGB to YCbCr, the second step is to convert each color band to binary vector, then divide this band in the secret image into four-part, each part is appended with a binary vector of each cover image in variable locations, the third step is converting the color space from YCbCr to RGB color space and the generated shares, hidden with covers, are ready for transmission over the network. Even if the hackers get a piece of data or even all, they cannot retrieve the whole picture because they do not know where to hide the information. The results of the proposed scheme guarantee sending and receiving data of any length. The proposed method provides more security and reliability when compared with others. It hides an image of size (234x192) pixels with four covers. The MSE result is 3.12 and PSNR is 43.74. The proposed method shows good results, where the correlation between secret and retrieved images is strong ranging from (0.96 to 0.99). In the proposed method the reconstructed image quality is good, where original and reconstructed images Entropy are 7.224, 7.374 respectively

Cellular Automata Based Image Authentication Scheme Using Extended Visual Cryptography

Most of the Visual Cryptography based image authentication schemes hide the share and authentication data into cover images by using an additional data hiding process. This process increases the computational cost of the schemes. Pixel expansion, meaningless shares and use of codebook are other challenges in these schemes. To overcome these issues, an authentication scheme is proposed in which no embedding into the cover images is performed and meaningful authentication shares are created using the watermark and cover images. This makes the scheme completely imperceptible. The watermark can be retrieved just by superimposing these authentication shares, thus reducing the computational complexity at receiver's side. Cellular Automata is used to construct the master share that provides self-construction ability to the shares. The meaningful authentication shares help in enhancing the security of the scheme while size invariance saves transmission and storage cost. The scheme possesses the ability of tamper detection. Experimental results demonstrate the improved security and quality of the generated shares of the proposed scheme as compared to existing schemes

Expressive Color Visual Secret Sharing with Color to Gray & Back and Cosine Transform

Color Visual Secret Sharing (VSS) is an essential form of VSS. It is so because nowadays, most people like to share visual data as a color image. There are color VSS schemes capable of dealing with halftone color images or color images with selected colors, and some dealing with natural color images, which generate low quality of recovered secret. The proposed scheme deals with a color image in the RGB domain and generates gray shares for color images using color to gray and back through compression. These shares are encrypted into an innocent-looking gray cover image using a Discrete Cosine Transform (DCT) to make meaningful shares. Reconstruct a high-quality color image through the gray shares extracted from an innocent-looking gray cover image. Thus, using lower bandwidth for transmission and less storage

Secured Lossless Share Watermarking

Security has gained a lot of importance as information technology is widely used. The main issue in visual cryptography is quality of reconstructed image. This problem is overcome by using “Secured Lossless share Watermarking ”. In this method the quality of reconstructed image is higher and the security of share is high compare with conventional visual cryptographic scheme. The secret image is converted into. Each share is embedded to different carrier images. Invisible watermarking method is used for embedding carrier image and shares. For security, the invisible watermarked shares are then encrypted, AES modified encryption method is used. The encrypted shares are send to other participants. At the receiver end receiving the shares and decrypt the shares, then combining these shares together reveal the secret. The quality of rejoined shares and original secret shares are almost same. DOI: 10.17762/ijritcc2321-8169.15038

Visual Cryptography and Steganography Methods - Review

In today’s information era information hiding becomes very much important as people transmits the information as innocent as credit card to online stores and as dangerous as terrorist plot to hijackers. The art of information hiding receive attention of the researchers. This paper provides a review of two methods – Visual Cryptography and Steganography for secure communication via a common communication channel. DOI: 10.17762/ijritcc2321-8169.16043

Study of Reversible Scheme for Data Hiding

Web is the prominent correspondence media now a days yet message exchange over the web is confronting a few issue, for example, copyright control, information security, information, confirmation and so forth. Information stowing away assumes a critical part in information security. It is a procedure in which mystery information or data is put away or covered up into cover media. Thus many explores are advancing on the field like web security, steganography, and cryptography. At the point when exchange the safe or private information over a shaky channel it is expected to encode cover or unique information and after that insert the protected information into that unique or, on the other hand cover picture

Multi Level Encryption Scheme for Transferring Secret image

As the rapid development of Internet Technology, Security and Privacy of data being transmitted has become the major issue. Transfer of data securely and reliably has become one of the challenges. Security issues should be considering because hackers may utilize weak link over communication network to steal information. Cryptography is the technique used to keep the message secure. Many images transmitted via Internet containing secret information but not secure. Encryption technique which prevents unauthorized access of data. Visual Cryptography technique introduced by Naor and Shamir, in which secret image is divided into number of shares. No information about secret image is revealed from individual share. Decryption can be done by overlaying one share above the other share. In this paper the idea is to increase the security level as the basic model of Visual Cryptography is not an efficient tool to hide the information. The secret image is encrypted using Arnold’s Transformation technique in the first level. In the second level create two shares from encrypted image using basic (2, 2) Visual Cryptography technique. To increase the security level, instead of sending these shares to receiver, third level security is adopted. In third level security, shares are embedded in two host images using Chang and Yu’s method. Generated shares are embedded into respective host images so that the attacker cannot suspect the secret image in it. On the receiver end, shares are extracted from camouflage image and then stacked to get the encrypted image. Encrypted image is decrypted using Inverse Arnold Transformation