Design and Implementation of a (2, 2) and a (2, 3) Visual Cryptographic Scheme

In this paper two methods for (2, 2) and (2, 3) visual cryptographic scheme(VCS) is proposed. The first scheme considers 4 pixels of input image at a time and generates 4 output pixels in each share. As 4 output pixels are generated from 4 input pixels dimension and aspect ratio of the decrypted image remain same during the process. The second scheme considers 2 pixels (1 block) of input image at a time and generates 3 output pixels in each share. Here probability of 1/3 for black pixel is maintained in each share. The scheme improves the contrast of output image. The dimension of revealed image is increased by 1.5 times in horizontal direction and remains same in vertical direction

A Simple Scheme for Visual Cryptography

Here an algorithm is proposed to implement (2, 2) secret sharing problem which reduces the size (resolution) of the generated shares. Instead of considering one pixel at a time to generate the share, two consecutive pixels of the original image are considered row wise. Finally a pixel share having six pixels is generated for the considered two consecutive pixels. Thus we get six pixels instead of eight pixels in the shares corresponding to two pixels in the original image. As a result two pixels (8-6 = 2) in the share are reduced corresponding to two pixels of original image

Poems

Hottentot Venus The Thirteenth Year of my Daughter Beyond the Himalayan Ranges Notes Towards a Nature Poem The Dragonfly in the Sun The King Has No Clothes All the Elements How to Save a Life Partnershi