Secret Sharing Using 3 Level DWT Method of Image Steganography Based on Lorenz Chaotic Encryption and Visual Cryptography

2015 ◽  
Author(s):  
Barnali Gupta Banik ◽  
Samir Kumar Bandyopadhyay
Keyword(s):  
Secret Sharing ◽  
Visual Cryptography ◽  
Image Steganography ◽  
Chaotic Encryption

scholarly journals VISUAL CRYPTOGRAPHY FOR COLOR IMAGES

2013 ◽  
pp. 147-149
Author(s):  
ASHWATHIMESANGLA AO
Keyword(s):  
Secret Sharing ◽  
Visual Cryptography ◽  
Color Images ◽  
Secret Sharing Scheme ◽  
Secret Image ◽  
Secret Information ◽  
Host Image ◽  
Sharing Scheme ◽  
Visual Cryptography Scheme

Visual cryptography is a secret sharing scheme for encrypting a secret image, it is a perfectly secure way that allows secret sharing without any cryptographic computation, which is termed as Visual Cryptography Scheme (VCS). In this paper secret image is divided into shares (printed on transparencies), and each share holds some information. At the receiver this shares are merged to obtain the secret information which is revealed without any complex computation. The proposed algorithm is for color host image, divided into three color planes Red, Green, Blue and merged with secret image which is binarized and divided into shares. The decoding requires aligning the result obtained by merging color host image and shares, so as to obtain the secret image.

Chaotic Map for Securing Digital Content

2016 ◽  
Vol 3 (1) ◽  
pp. 20-35 ◽  
Author(s):  
Dhiraj Pandey ◽  
U. S. Rawat
Keyword(s):  
Secret Sharing ◽  
Chaotic Map ◽  
Logistic Map ◽  
Visual Cryptography ◽  
Visual Quality ◽  
Digital Content ◽  
Digital Information ◽  
Pixel Expansion ◽  
Empirical Results ◽  
Logistic Chaotic Map

Progressive Visual Cryptography (PVC) is quite suitable for sharing sensitive digital data.Previous research on PVC, such as Fang et al. (2006) and W.P.Fang et al.(2008) were all carrying pixel-expansion problem and also gives a poor visual quality on the recovered stacked image. Recently, Hou&Quan (2011) have developed a progressive scheme for secret sharing. It is observed that shares generated by the scheme are free from pixel expansion problem, but shares are not fully secure. In this paper, a new progressive sharing algorithm based on logistic chaotic map has been proposed to overcome the said limitation of Hou (2011) scheme. The irregular outputs of the logistic map are used to encode a secret digital information carrying image. The performance of the algorithm in the scheme of Hou (2011) is critically analyzed and compared with new suggested scheme. Empirical results are presented to showcase the performance of the authors' proposed scheme in terms of its effectiveness (imperceptibility and security) and feasibility.

scholarly journals An investigation of visual cryptography and its applications in secure communications

2017 ◽  
Author(s):  
Elham Shahab ◽  
Hadi Abdolrahimpour
Keyword(s):  
Visual System ◽  
Secret Sharing ◽  
Human Visual System ◽  
Visual Cryptography ◽  
Input Image ◽  
Secure Communications ◽  
Security Issues ◽  
Main Input ◽  
To Receive ◽  
Distinguishing Features

Secret sharing approach and in particular Visual Cryptography (VC) try to address the security issues in dealing with images. In fact, VC is a powerful technique that combines the notions of perfect ciphers and secret sharing in cryptography. VC takes an image (secret) as an input and encrypts (divide) into two or more pieces (shares) that each of them can not reveal any information about the main input. The decryption way in this scenario is done through superimposing shares on top of each other to receive the input image. No computer participation is required, thus showing one of the distinguishing features of VC. It is claimed that VC is a unique technique in the sense that the encrypted message can be decrypted directly by the human visual system.

scholarly journals Pixel-sieve cryptographic primitives with LSB steganography

2017 ◽  
Vol 7 (1) ◽  
pp. 14-22
Author(s):  
Arpad Incze
Keyword(s):  
Secret Sharing ◽  
Visual Cryptography ◽  
Secret Message ◽  
Cryptographic Primitives ◽  
New Approach ◽  
Alternative Method ◽  
Original Message ◽  
Carrier Image ◽  
Least Significant Bits

AbstractThis paper contains a brief description of new approach regarding LSB steganography. The novelty of the method resides in the combination of LSB (Least Significant Bits) steganography with some primitives of the pixel-sieve/bit-sieve cryptographic method. In short, we propose to use two or more carrier images and the sieving algorithm, borrowed from the pixel sieve primitive, to determine which carrier image will receive the next set of bits of the secret message. While in classic LSB steganography the secret message must be encrypted prior to embed the information into the carrier image, in our proposal the message is scrambled between the shares in a pseudo random way. An attacker will need all the carrier images and the sieving key in order to reconstruct the original message. Also we recommend an alternative method in which instead of simply replacing the last bit/bits we use them as XOR keys to further enhance the security. Keywords: steganography, cryptography, secret sharing; visual cryptography, LSB.

Sign in / Sign up

Export Citation Format

Share Document