Visual Cryptographic Scheme Using Image

Processing
Vijaylaxmi1, Nisheeth Saxena2

1 2
M.Tech. Student, Assistant Professor CSE Deptt.

Mody Institute of Technology and Science, Sikar, Raj, India

1
er.chinkygarg@gmail.com, 2nisheeth_111@yahoo.com

Abstract- Numerous algorithms have been receiver decrypts the secret message by using the
proposed in the field of Visual cryptography. same key and retrieves the same key. These
The goals of these algorithms are improving the algorithms are less complex and use very less
security, reliability, and efficiency. We are going processing time to execute but there is need to
to review the concept of visual cryptography and securely share of the key between sender and
at the last we have propose the efficient receiver. In these algorithms the small key has to
algorithm that uses the basic concept of Visual share very carefully and confidentially instead of
cryptography and image processing. the huge chunk of message data.
Asymmetric Key Cryptography uses a different
Keywords- Image Processing, Visual Cryptography
key for encryption as the one has used for
and Cryptography
decryption. It is also known as Public key
cryptography because the system requires two keys
I. BASIC OVERVIEW ON CRYPTOGRAPHY
one for encryption of the secret message and
Cryptography is a widely used technique for another one for the decryption, to reveal that secret
encryption and decryption of the secret information; message. This technique doesn’t require any
it converts the information into unreadable cipher. confidentiality to share the key between sender and
There are basically two main techniques that are receiver. The public key cryptography works slower
widely used for the purpose of encryption and but it provide more security than the symmetric key
decryption of secure information symmetric key cryptography. The most common cryptographic
cryptography and asymmetric key cryptography. algorithms of this categories are Data Encryption

The Symmetric Key Cryptography uses a same Standards (DES), Elliptic curve cryptography etc.

key for encryption and decryption of the secret II. BASIC OVERVIEW ON VISUAL
message. The sender and receiver share the same CRYPTOGRAPHY
key very privately. The sender encrypts the secret
message by using the same key and sends the Visual Cryptography is used for the encryption
encrypted data to the receiver. On the other hand of visual information like images, written materials,
and handwritting notes, print and scanned data in a
secure way so that the decryption can be performed
by human eyes. Visual cryptography was pioneered
by Moni Naor and Adi Shamir in 1994. They image is revealed.
demonstrated a visual secret sharing scheme, where
an image was broken up into n shares so that only encrypts the secret image into n shares such that
someone with all n shares could decrypt the image,
while any n-1 shares revealed no information about
the original image. Each share was printed on a
separate transparency, and decryption
performed by overlaying the shares. When all n when any group of at least k shares are overlaid the
shares were overlaid, the original image would
appear. Fig.1 shows the working of visual
cryptography.
Share 1 Share 2
Secret
Fig 1.Revealed the secret image from two shares
By using the following access structure schemes we
can achieve a visual cryptosystem [3]
1:(2, 2)-Threshold VCS: This is a simplest component of the color, the B component of the
threshold scheme that take a secret image and
encrypts it into two different shares that reveal the
secret image when they are overlaid.
2:(2, n)-Threshold VCS: This scheme
encrypts the secret image into n shares such that
when any two or more shares are overlaid the secret
3:(n, n)-Threshold VCS: This scheme
only when all the n shares are combined will
revealed the secret image.
4:(k, n)-Threshold VCS: This scheme
was encrypts the secret image into n shares such that
secret image can be revealed.
III. IMAGE FILES AND THIER PROPERTIES
Binary image takes only two values either ‘0
‘or ‘1’. The brightness graduation cannot be
differentiated in the binary image whereas
grayscale images contain only brightness
information. Each pixel value of greyscale
corresponds to an amount or quantity of light.
A color image has three values per pixel and
they helps in the measurement of intensity and
chrominance of light-coloured images can be
modelled as three band monochrome image data,
where each band of data correspond to a digital
colour. Common colour spaces are RGB (red, green
and blue), HSV (Hue, saturation and value), and
CMYK (Cyan, Magenta, Yellow, Black). An image
has 6 properties which includes the position of the
colour pixels on x-axis, the position of the color in
the y-axis, the R component of the color, the G
color and sixth is image description like size. These
properties are stored in first few lines of an image.
8-bit per pixel image can be used to achieve more
general bit encoding system.
 IV. PROPOSED SCHEME
In this section we are going to present the
proposed visual cryptographic algorithm, which is that decryption can be done by human visual
uses the concept of image processing and
cryptography.
Step1: Take two images for input. (Let images are
X and Y where X is the original or the secret image have to perform inverse convolution theorem on
sender wants to encrypt and Y is the cover image
that has to be embedded with the secret image).
Step2: Add some noise to secret image i.e. X and
here noise can be salt & pepper or Gaussian noise.
(Change its name X1 from X)
Step3: Convert the noisy image to equivalent
binary image.
Step4: Generate two shares Z1 and Z2: Generate
the Z1 by applying the convolution theorem on the
secret image. (For applying convolution first matrix authentication can be checked by the digital
will be from the secret image and second matrix signatures. This is an attempt to make a secure
will be from the cover image)
Step5: Generate the Share Z2 by using the secret
image X. Let XB and XW are the collection of the
location of all the black and white pixels
respectively. The black pixels of Z2 will be the
same as the pixels of Z1 and the white pixels of
share Z2 will be generated by the rotation of the
matrix obtained from the share Z1.
Secret Image X
Add Noise X1
Convert into Equivalent Binary X2
Apply convolution
theorem on X2 and Y
to get first share Z1
Generate Second share
Z2 from Z1 and Binary
image
Fig2. Proposed algorithm for creating the shares
Decryption
The core advantage of visual cryptography
system. As we know that visual cryptographic
decryption does not require any decryption
algorithms or computation. But in this algorithm we
share Z1 and then overlapping of the shares we can
get the original image or secret image.
V. CONCLUSON
In this paper a modified scheme of visual
cryptography has been proposed. The scheme is
based upon some areas of image processing and
matrices have been played an important role to
build this scheme. Confidentiality is maintained and
transfer of images between two trusted parties.
REFERENCES
[1] M. Naor, A. Shamir, Visual cryptography, Advances in cryptology
Eurocrypt’94, Berlin, 1995 LNCS 950:1-12.
[2] William K. Pratt, Digital Image Processing, Paperback.
[3] G. Ateniese, C. Blundo, A. De Santis, and D. R. Stinson, Visual
Cryptography for General Access Structure, Information and Computation,
Vol. 129, No.2, (1996), pp. 86-106.
[4] Gilat, Amos(2004). MATLAB: An Introduction with Applications 2nd
Edition, John Wiley & Sons.
[5] Applied Cryptography, Second Edition: Protocol Algorithms and Source
Code in C by Bruce Schneier.
Cover Image Y
[6] Li-Guo FANG, Ya-Min Li and Bin Yu Multi-secret, Visual Cryptography
Based on Reversed Image, Third International Conference on Information
and Computing, 2010.
[7] J. B. Feng, H. C. S. Tsaic, et al.. Visual secret sharing for multiple secrets.
Pattern Recognition, 2008, 41(12):3572-3581.