scholarly journals Secret Image Sharing using 2-Pixel Visual Cryptography Encryption

2019 ◽  
Vol 8 (4) ◽  
pp. 1612-1614
Keyword(s):  
Visual Cryptography ◽  
Binary Image ◽  
Encryption Algorithm ◽  
Original Image ◽  
Secret Image Sharing ◽  
Digital Text ◽  
Written Text ◽  
Image Sharing ◽  
Visual Cryptography Scheme ◽  
Automated Tool

Visual Cryptography Scheme (Vcs) Is A Procedure For Encrypting Visual Data Such As Hand-Written Text, Image, Digital Text, Captured Image Etc. In This Scheme, The Shares Are Generated By Scrambling The Pixels Of The Original Image. Further, These Shares Are Sent To Receiver For Decryption At The Receiver End. In this paper, we have proposed an automated tool that takes the binary image as an input, and generates initial shares with one pixel encryption algorithm. Further, these initial shares are encrypted using 2-pixel encryption algorithm. The encrypted shares are then sent to the receiver for decryption to obtain the initial shares. The receiver then stacks the shares to get the original image. The proposed work which is presented in the methodology is the extension of VCS algorithm

scholarly journals Secret Image Sharing using Visual Cryptography Shares with Acknowledgement

2019 ◽  
Vol 8 (11) ◽  
pp. 3474-3481
Keyword(s):  
Visual Cryptography ◽  
Original Image ◽  
Secret Image Sharing ◽  
K Value ◽  
Secret Image ◽  
Black And White ◽  
Image Sharing ◽  
Minimum Number ◽  
Original Picture ◽  
Insufficient Number

Visual Cryptography is an encryption technique in which the secret image is encoded and divided into n meaningless images called shares. The shares look like black and white dots embedded randomly in an image. These shares don’t reveal any information about the original image. Every share was printed on transparent paper and decrypted through the superimposition of shares without any computer decryption algorithm. When all n shares were overlapped, the original picture would appear. A (k, n)-threshold visual cryptography is a technique in which n is the maximum number of shares that are to be generated and k is the minimum number of shares that are required to decrypt the original image. If the insufficient number of shares, which are less than the k value is given to the decryption function, the decryption function will generate the output, which doesn’t reveal any clue to the original image. This paper presents how the Entropy, Mean Square Error (MSE), Peak Signal Noise Ratio (PSNR) values varies with respect to given same image of different sizes.

scholarly journals Significant Secret Image Sharing Scheme Based on Boolean Operation

2017 ◽  
Vol 17 (2) ◽  
pp. 134-150
Author(s):  
Monu Verma ◽  
Rajneesh Rani
Keyword(s):  
Fault Tolerance ◽  
Partial Information ◽  
Vital Role ◽  
Boolean Operation ◽  
Original Image ◽  
Secret Image Sharing ◽  
Secret Image ◽  
Image Sharing ◽  
Sharing Scheme ◽  
Secret Image Sharing Scheme

Abstract Traditionally, (k, n) secret image sharing is an approach of breaking down a secret image into n number of shadow images to assign them to n number of users, so that any k or more then k users can bring back the secret image. But in case of less than k, users cannot reveal any partial information about the original image. We have proposed a significant secret image sharing technique based on XOR with arithmetic operations that upgrade the performance of traditional secret image sharing approaches by serving importance to shadow images according to user’s significance. This scheme also conserves the fault tolerance property which plays a vital role in image sharing field.

scholarly journals Colour Visual Cryptography (3,3) Scheme

2021 ◽  
Vol 12 (2) ◽  
pp. 3189-3198
Author(s):  
Mandru Manisha, Et. al.
Keyword(s):  
Visual Cryptography ◽  
Original Image ◽  
Visual Data ◽  
Black And White ◽  
Visual Cryptography Scheme ◽  
Cryptographic Techniques

Visual Cryptography is an encryption technique which performs only encryption in cryptography, and it is used to encrypt every visual data. And this cryptography is different and unique in all cryptographic techniques, because of not performing decryption process mechanically, and that is done mechanically. In normal visual cryptography only black and white images are encrypted. In this paper we propose a different type of visual cryptography scheme for colour imagesin CMY format. And it protects the secret of the original image and no other techniques does not decrypt it except our decryption technique.

An Improved Size Invariant (n, n) Extended Visual Cryptography Scheme

2016 ◽  
Vol 12 (2) ◽  
pp. 80-88 ◽  
Author(s):  
Rahul Sharma ◽  
Nitesh Kumar Agrawal ◽  
Ayush Khare ◽  
Arup Kumar Pal
Keyword(s):  
Visual Cryptography ◽  
Visual Quality ◽  
Binary Image ◽  
Secret Message ◽  
Grayscale Image ◽  
Secret Image ◽  
Meaningful Shares ◽  
Connectivity Property ◽  
Visual Cryptography Scheme

In this paper, the authors have presented a (n, n) extended visual cryptography scheme where n numbers of meaningful shares furnish a visually secret message. Initially they have converted a grayscale image into binary image using dithering method. Afterwards, they have incorporated pixel's eight neighboring connectivity property of secret image during formation of meaningful shares. The scheme is able to generate the shares without extending its size. This approach has enhanced the visual quality of the recovered secret image from n numbers of shares. The scheme has been tested with some images and satisfactory results are achieved. The scheme has improved the contrast of the recovered secret image than a related (n, n) extended visual cryptography scheme.

scholarly journals Implementation of Steganographic Algorithms Based on Exact Histogram Matching and Colour Visual Cryptography

2019 ◽  
Vol 9 (2) ◽  
pp. 519-522
Keyword(s):  
Data Transmission ◽  
Visual Cryptography ◽  
Secret Image Sharing ◽  
Secret Key ◽  
Secret Data ◽  
Image Sharing ◽  
Histogram Specification ◽  
Specification Method ◽  
Meaningful Share ◽  
Security Concern

Sensitive secret data transmission through internet has been of great security concern which can be overcome by steganographic methods achieved through secret image sharing. Two novel steganographic secret algorithms based on colour visual cryptography and exact histogram specification is proposed in the present study. The former approach combines colour visual cryptography with a secret key to produce less distorted meaningful share images. A specified histogram acts as the key for the second approach and provides better security and data obscurity compared to conventional approaches. A novel histogram specification method is also proposed which exactly matches the histogram of an image to a specified histogram

Sign in / Sign up

Export Citation Format

Share Document