A Survey Paper on An Extended Visual Cryptography Scheme Without Pixel Expansion

For Halftone Images

Student Name:-Shivani Sarode
Email-Id:-sarodeshiv@gmail.com
Guide Name:-Mr.Sumit Andhalkar
Email-Id:Introduction

white dots are varied to simulate different

Visual Cryptography is a unique

Encryption way to hide information in
images in such a manner that it can be
decrypted by the human idea if the proper
key image is used. Visual Cryptography is
a furtive or a secret sharing scheme which
uses images distributed as shares such that,
when the shares are superimposed, a
hidden secret image is shown.

shades of gray. A halftone image is

prepared as a series of dots rather than a
continuous tone. These dots can be
different sizes, different colors, and at
some occasion even different shapes also.
Larger dots are used to signify darker,
denser areas of the image, while smaller
dots are used for lighter areas. Halftone
images use used in newspapers and
magazines since it is much more efficient

In Extended Visual Cryptography,

way to print images. As a halftone image is

the share images are constructed to contain

prepared by discreet dots, it requires

meaningful or an important cover images,

significantly less ink to print than a

so providing opportunities for integrating

continuous tone image.

Visual

Cryptography

and

Biometric

Security Technique. Here we offer a

Halftone

Images

improves

the

technique or one way for processing

quality or class of the share images and the

Halftone Images.

recovered secret image in an Extended

Visual Cryptography scheme for which the

In

printing,

a continuous

size of the share images and the recovered

tone image, such as a snap, that has

image is equivalent to the original

been converted into

black-and-white

Halftone secret image. The resulting

image. Halftones are produced through a

scheme maintains the perfect security of

process

the original Extended Visual Cryptography

called Dithering,

in

which

the density and pattern of black and

approach.

Literature survey
Preserving the privacy of digital

In an ended past few years, rising

biometric information (e.g., face images)

concern about the privacy of information

stored in a central database has become of

shared in computer systems has enlarged

paramount importance. This job explores

interest in data security. Visual

the possibility of using visual

cryptography is a secure secret sharing

cryptography for imparting privacy to

system that divides secret images into

biometric information such as fingerprint

shares which on their own reveal no

Images, iris codes, and face images. In the

information of the oriinal secret image.

case of faces, a private face image is

Recovery of the secret image can be done

dithered into two host face images that are

by superimposing the shares. Thus, the

stored in two separate database servers

process does not require any special

such that the private image can be shown

software or hardware for cryptographic

only when both sheets are concurrently

computations. Still, loss of resolution and

available, the individual sheet images do

contrast, and also the image size expansion

not expose the identity of the personal

which results in the need for storage space,

image. A sequence of experiments on the

are resulting problems and have been

XM2VTS and IMM face databases

concentrating on many researchers. Here

confirm the following: 1) the possibility of

we have given a novel on visual secret

hiding a private face image in two host

sharing scheme without image size

face images; 2) the successful matching of

expansion. Compared to other schemes of

face images reconstructed from the sheets;

visual cryptography, our completely secure

3) the incapability of sheets to reveal the

scheme not only does not have pixel

identity of the private face image; 4) using

expansion, but also provides a high quality

dissimilar pairs of host images to encrypt

recovered image.

dissimilar samples of the same private

face; and 5) the complexity of cross-

Here we will discuss the problem

database matching for determining

of encoding a secret binary image SI into n

identities. A similar process is used to de-

shares of meaningful halftone images

identify fingerprint images and iris codes

within the scheme of visual cryptography

previous to storing them in a central

(VC). Secret pixels encoded into shares

database.

introduce noise to the halftone images. We

enlarge our previous work on halftone

visual cryptography and propose a new

binary images but here we establishes the

method that can encode the secret pixels

extended visual cryptography scheme

into the shares through the direct binary

suitable for natural images. Generally,

search (DBS) halftoning method. The

visual cryptography suffers from the

perceptual errors between the halftone

deterioration of the image quality. Here we

shares and the continuous-tone images are

also take a method to improve the quality

minimize with respect to a human visual

of the output images. The trade-off

system (HVS) model . The secret image

between the image quality and the security

can be clearly decoded without showing

are discussed and assessed by observing

any interference with the share images.

the actual results of this method. In

The protection of our method is guaranteed

addition, the optimization of the image

by the properties of VC. Simulation results

quality is discuss.

show that our planned method can improve

significantly the halftone image quality for

Visual Cryptography facilitates

the encoded shares compared with

hiding a secret image into n number of

previous algorithms.

shares disseminated to n number of

participants. This kind of system is very

Extended Visual Cryptography is a

helpful as the participants in such

type of or kind of cryptography which

Safety systems need not know the

encodes a number of images in the way

cryptographic knowledge in order to

that when the images on transparencies are

recover the secret image from the shares.

stacked together, the secret message

This phenomenon is known as VCS

appears without a trace of original images.

(Visual Cryptography Scheme). An

The decryption is done directly by the

extended VCS is the one which is able of

human visual system with no particular

generating meaningful shares when

cryptographic calculations. Here we are

compared with the shares of the VCS. This

representing a system which takes three

paper proposes construction of EVCS by

pictures as an input and generates two

Embedding, the casual shares (result of

images which match up with the two of the

VCS) into covering images. The observed

three input pictures. The third picture is

results revealed that the proposed EVCS is

reconstructed or rebuild by printing the

extra secure and flexible than the EVCSs

two output images onto transparencies and

found in Literature.

stacking them together. While the

preceding researches basically handle only

An extended visual cryptography

_ A common technique to execute EVCS,

scheme (EVCS), for an access structure

which uses hypergraph colourings. This

(Qual; Forb) on a set of n participants,

technique yields (k; k)-threshold EVCS

is a method to encode n images in such a

which are best with respect to the pixel

way that when we stack collectively the

expansion.

transparencies associated to participants in

any set X 2 Qual we get the secret
message with no trace of the original
images, but any X 2 Forb has no
Conclusion

information on the shared image.

Moreover, after the unique images are
encoded they are still meaningful, that is,

Here

any customer will be familiar with the

cryptography without expansion. Here we

image on his transparency. The main

will study that using an intelligent pre-

contributions of this are the following:

processing of halftone images based on the

_ A trade-o_ between the difference of the

characteristics of the original secret image,

reconstructed image and the contrast of the

we are capable to produce good quality

image on each transparency for (k; k)-

images in the shares and the recovered

threshold EVCS (in a (k; k)-threshold

image. The point which is to be considered

EVCS the image is perceptible if and only

is that the other applications can also

if k transparencies are stacked together).

benefit from the pre-processing approach,

This yields a essential and su_cient

such

situation for the reality of (k; k)-threshold

cryptography, which hides multiple images

EVCS for the values of such contrasts. In

in shares.

case a scheme exists we explicitly build it.

we

as

explore

multiple

extended

image

visual

visual