International Journal of Computer Trends and Technology (IJCTT) volume4Issue 9 Sep 2013

ISSN: 2231-2803 http://www.ijcttjournal.org Page 3100

Visual Cryptography Implementation within
Dynamic Group for Secure Data Access
ShamBhise
1
, Soujanya
2

Sham Bhise, pursuing M.Tech(CSE) from Holy Mary Institute of Technology and Science, Hyderabad, Andhra Pradesh, India,
Affiliated to JNTU Hyderabad.
S.Soujanya, working as an Asst. Professor, Department of Computer Science Engineering at Holy Mary Institute of Technology
and Science, Hyderabad, Andhra Pradesh, India, Affiliated to JNTU Hyderabad.

Abstract - Visual Cryptography is one of the cryptography
techniques which are used in secret sharing scheme where a
secret image was encoded into transparencies and stacking of any
out of transparencies reveals the secret image. By stacking fewer
transparencies is unable to extract any information about the
secret. We also discussed the deletions and additions of users in a
dynamic user group. In order reduce the overhead of generating
and distributing transparencies in user changes it, in this paper
we proposed a VC scheme with unlimited based on the prospect
mold. The proposed scheme allows changing dynamically in
order to include new transparencies without regenerating and
redistributing the original transparencies. In specifically, an
extended VS scheme based on a prospect mold and basic
matrices is proposed. An equation is derived from the
fundamental definitions of the VC scheme here, and then in VC
scheme achieving maximal contrast can be designed by using the
derived equations. And the maximum contrasts with two are
implicitly solved in this paper.

Index TermsCryptography, VS scheme, Visual Cryptography,
transparencies,


I. INTRODUCTION

Changing of plaintext into cipher text i.e. changing the
original text into unintelligible code called Cryptography.
Transferring plaintext into cipher text is encryption and cipher
text to plaintext is decryption. This cryptography can be done
using a secret Key or without Key. And in the same way
Visual cryptography means applying cryptography concepts
with images and is a branch of secret sharing key. Here in this
VC scheme, a secret image is encoded into transparencies
using algorithms, and then the content of each and every
transparency is noise-like so that the secret information cannot
be retrieved from any one transparency via human visual
observation or signal analysis techniques. In general, a -
threshold VC scheme has the following properties: The
stacking of any out of those VC generated transparencies can
reveal the secret by visual perceptions and any other
technique, but the stacking this of any or fewer number of
transparencies cannot retrieve any information other than the
size of the secret image. Naor and Shamir proposed a
threshold VC scheme based on basis matrices, and the model
had been further studied and extended. The related works
include the VC schemes based on probabilistic models,
general access structures, VC over halftone images, VC for
color images, cheating in VC, the general formula of VC
schemes, and region incrementing VC.
Contrast is one of the important performance metrics for
VC schemes. Generally, the stacking revelation of the secret
with higher contrast represents the better visual qualities, and
also therefore with this the stacking secret with high contrast
is the goal of pursuit in VC designs. Naor and Shamir define a
contrast formula which has been used widely in many more
experiments. So by this based on this definition on contrast
with, there are many studies we are attempting here to achieve
the contrast bound of VC scheme. Moreover, there exist VC
related researches using differential definitions of contrast.
Another important metric is the pixel expansion denoting the
number of sub pixels in transparency used to encode a secret
pixel. The minimization of pixel expansions has been
investigated in previous studies. The probabilistic model of
the VC scheme is mainly based on the basis matrices here, but
the problem is that only one column of the matrices is chosen
to encode a binary secret pixels, and rather than most of the
traditional VC scheme utilizing the whole basis matrices. The
size of the generated transparencies is identical to the secret
image. Yang also proposed a prospect mold of VC scheme
and the two cases and is explicitly constructed to achieve the
optimal contrast. Based on Yang, Cimato et al. proposed a
generalized VC scheme in which the pixel expansion is
between the probabilistic model of VC scheme and the
traditional VC scheme.
Encrypting an image by random grids (RGs) was first
introduced by Kafri and Keren in 1987. A binary secret image
is encoded into two noise-like transparencies with the same
size of the original encrypted image, and then the stacking of
these two transparencies reveals the content of the secret.
Comparing RGs with all basis matrices here, and majorly the
advantages is that the size of generated transparencies is
unexpanded. The RG scheme is similar to the probabilistic
model of VC scheme here, but the only problemis that RG
International Journal of Computer Trends and Technology (IJCTT) volume4Issue 9 Sep 2013

ISSN: 2231-2803 http://www.ijcttjournal.org Page 3101
scheme is not based on the basis matrices in the theory. The
recent experiments include the RG for color image, RG, and
RG schemes. We also compare the proposed method with RG
[29] in Section IV.
We consider the scenario of a dynamic user group, where new
participants are to join the user group with original
participants; and the transparencies need to accommodate the
new users. If the transparencies are to be generated with the
traditional VC scheme, the original transparencies need to be
discarded, and the new transparencies need to be generated
with the traditional VC scheme. The regeneration and
redistribution of the whole transparencies consume computing
and communication resources and may lead to the potential
security vulnerability.
Here dynamic group in the paper means that people are
randomly leaving and adding into the group and if we perform
a secret image among a dynamic group then there should be n
number of transparencies are required and if any people are
added or any people leave that group then again we need to
generate new shares for them and if we go for old approach
then we are not able to get original image means secret
information so that is the reason why we are going to
implement this Prospect Mold to avoid the regeneration of
transparencies and no need worry about to regeneration of the
secret information.

In this paper, we propose a prospect mold of VC
scheme for secretly sharing the data. The major contribution is
that the proposed scheme accommodates dynamic changes of
users in the group sharing a VC secret. The proposed scheme
allows changes of users without regeneration and
redistribution of VC transparencies, which reduce the
computing and communication resources in accommodating
user changes to the experiment. Here scheme is capable of
generating all arbitrary number of transparencies and the
explicit algorithms are proposed to generate the
transparencies. For a group with initial users there , and the
proposed Algorithm 1 was explicitly generates for the
required transparencies. For newly joining participants, the
new transparencies can be explicitly generated by using the
Algorithm2 in our project, and also the newly transparencies
will be distributed to the new participants without the need to
update the original transparencies that are to be distributed.
Then the secondary contribution of experiments in paper is
that this paper designs an implementation of VC based on the
prospect mold, and the proposed scheme allows the unlimited
number of users. For the conventional VC scheme to
implement the case, the mathematical manipulations of
infinite size of basis matrices and variables are often required,
which is computationally prohibitive. Our approach designs
an implementation scheme which is capable of producing a
finite subset of the complete infinite transparencies through
the proposed Algorithms 1 and 2, with computationally
feasible operations. We also derive an optimization problem
to solve the maximal contrast of the proposed VC scheme.

Fig 1. Binary Image


II. PROPOSED APPROACH BASIS MATRIX
Basis Matrix:
The basis matrices of VC scheme were first
introduced by Naor and Shamir [1]. In this paper, a white-and-
black secret image or pixel is also described as a binary pixel
or else using image in any format. In this basis matrices, in
order to encode a binary secret image , each secret pixel white
black will be turned into blocks at the corresponding position
of transparencies , respectively. Each block consists of
subpixels and each subpixel is opaque or transparent in image.
Throughout in this paper, here we use 0 to indicate the
transparent subpixel and 1 to indicate an opaque subpixel for
the image. Here If any two subpixels are stacked with
matching positions, then the representation of a stacked pixel
will be transparent to each other, so when the two side by side
pixels are both transparently. Otherwise, in the stacked pixel
was opaque. So Let denote the stacking operation as, and
defined as
0 0 =0,0 1=1,1 0=1, 1 1=1
Actually, can be treated as the bitwise operation OR. It
is noted that we use the notation T
i
T
j
to indicate the
stacking of the two transparencies T
i
and T
j
, since and can be
treated as two Boolean matrices.
International Journal of Computer Trends and Technology (IJCTT) volume4Issue 9 Sep 2013

ISSN: 2231-2803 http://www.ijcttjournal.org Page 3102
For the basis matrices, two collections of Boolean n by m
matrices C
0
and C
1
are constructed to encode the binary pixel ,
respectively. Each row of the matrix in C
0
and C
1
corresponds
to an encoded block, and the elements represent the sub
pixels. Before describing the definitions of C
0
and C
1
, we first
explain how to encode s. s For being white, the dealer
randomly chooses a matrix fromwith uniformdistribution and
then sends all the rows to each , respectively. For being the
black, if the dealer randomly chooses a matrix then fromC
0

with uniformdistribution and then sends all the rows to each
T
i
, respectively.
For s being black, the dealer randomly chooses a matrix from
C
1
with uniform distribution and then sends all the rows to
each, respectively. The C
0
and are required to meet the
conditions described in
Definition1. Let denote H() the hamming weight of (0-1) a
vector (i.e., the number of ones in ).
Definition 1: A (t, n) VC scheme with m sub pixels and
contrast >0 can be represented as two collections of n m
Boolean matrices C
0
and C
1
. Let be a constant integer. A valid
VC scheme is required to meet the following conditions:
1) For every matrix in C
0
, there the stacked of any out of
the n rows in the matrix satisfies .
2) For any matrix in , the stacked of any t out of the n rows
in the matrix satisfies .
3) For any k -element subset {i
1
,i
2
,..i
n
} subset {1,2,.n}
and , k<t the two collections of k m matrices obtained by
restricting each matrix in C
0
and C
1
, to rows i
1,
i
2,..,
i
k
are
indistinguishable in the sense that they contain the same
matrices with the same frequencies.
The first and the second conditions represent the
contrast requirements of the experiment. In usual situation,
with larger , with the stacking result is more visually
distinguishable. The third condition represents the security
requirement. A valid VC must be able to prevent the secret
pixels from being revealed by analyzing the patterns or
probability distributions fromk transparencies for k<t.
If we find n man Boolean matrix B
0
C
0
and an n
mBoolean matrix B
1
C
1
, we can construct C
0
and C
1
by
permuting all columns of the B
0
and B
1
, have expressed as

C
0
= {All the matrices obtained by permuting all
columns of B
0
}
C
1
= {All the matrices obtained by permuting all
columns of B
1
}

If two n m Boolean matrices B
i
and B
i
` can be
adjusted to become the same matrix with reordering columns,
and are equivalent in terms of generating .Therefore, the
orders of columns of and are technically insignificant.

m
n
=_
n
]
] hj,i
n
]=0

Example 1: An example of a (3, 4) VC scheme is


B
0
= 0 0 0 1 1 1
0 0 1 0 1 1
0 0 1 1 0 1
0 0 1 1 1 0

And B
1
= 0 0 0 1 1 1
0 0 1 0 1 1
0 0 1 1 0 1
0 0 1 1 1 0
The A
j ,n
are
A
0,4
= 1 A
1,4=
0 1 1 1
1 1 0 1 1
1 1 1 0 1
1 1 1 1 0
A
2,4=
1 1 1 0 0 0
1 0 0 1 1 0
0 1 0 1 0 1
0 1 1 0 1 1

A
3,4=
1 0 0 0 A
4,4
= 0
0 1 0 0 0
0 0 1 0 0
0 0 0 1 0

International Journal of Computer Trends and Technology (IJCTT) volume4Issue 9 Sep 2013

ISSN: 2231-2803 http://www.ijcttjournal.org Page 3103
Thus, B
0
is represented as H
0
=(0,1,0,0,2), and B
1
is
represented as H
1
=(2,0,0,1,0)



III. PROBABLISTIC SCHEME

For a given value of t, the transparencies can be continuously
generated with the (t, ) Opt Pr VC scheme. However,
practical applications require the algorithm to terminate within
the finite or countable steps. In order to meet the given
requirement, a finite number is used to specify the number of
transparencies in this algorithm. And the algorithmrequires
(x, y), obtained by solving or by looking up the Table I. At
last the outputs of Algorithm1 are transparencies and an index
table, where is the index of the used memory less sequence to
encode the secret pixel.

In the first round, we use Algorithm1 to generate n`
transparencies and Z. If we need not to generate more
transparencies in the future, Z is not required and discarded.
Otherwise, Z has to be stored in a place where we have a good
security, and also we should generate more transparencies in
the algorithmi.e T
1,
T
2
,.., T
n
by utilizing Z.
The result of the algorithm1 had shown in fig(i) and
a)T
1
b) T
2
c)T
1
T
2


Algorithm 1.The algorithm of(t,) optPrVC scheme
Input :A binary secret image S,two positive integers t,n,
and two vectors(X,Y).

Output: n transparencies I1,I2,,In

; an index table Z.
1 for each pixel s[w,] in S do
2 if s[w,]=white then
3 Generate an integer z {t 2k |k =0,1,..,t/ 2}
and P(z =t 2k) =y
t-2k
.
4 else
5 Generate an integer z {t 12k |k =0,1,,
(t 1)/ 2 And P(z =t 12k) =y
t-1-2k
.
6 end if
7-Z[w,] =z
8 for k=1 to n do
9 Assign randomly I
k
[w,] to 0 or 1 where P[I
k
[w,] =
0] =x
z

10 end for
11 end for

Algorithm 2: The Algorithm of (t,) ptPrVC scheme
by the index table Z
Input : An index table Z, a positive integer n, and a
vector X.
Output : n`` transparencies I
1
i
,I
2
i
,,I
nii
i

For each z[w,h] in Z do
For k=1 to n do
Assign randomly I
k
i
[w,] to 0 or 1 where
P(I
k
i
[w,] =0) =x
z.

End for
End for each

IV. CONCLUSION

In this paper we proposed Virtual cryptography scheme
with n values. From the experimental perspective, the
proposed one accommodates the dynamic changes of users
without regenerating and redistributing the transparencies in
here , in which it reduces computation and communication
resources required in managing the dynamically changing the
users group. With the theoretical experiments perspective,
this scheme can be considered as the prospect mold of VC
with unlimited n. Initially, the proposed scheme is based on
basis matrices of experiment, but here the basis matrices with
infinite size cannot be constructed practically. Therefore, the
prospect mold is adopted in the scheme. As the results, the
proposed scheme also provides the alternate verification for
the group by providing a key while at the time of encryption.

Finally in this proposed model we are just providing a
solution for the existing one about the dynamic group if a user
leave that group or if the user is added in to the group it is not
possible to regenerate the secret information by the proposed
approach we overcome this problemby simply generating the
transparencies to the new users and removed users
transparencies based up on the Basis Matrix.



International Journal of Computer Trends and Technology (IJCTT) volume4Issue 9 Sep 2013

ISSN: 2231-2803 http://www.ijcttjournal.org Page 3104

REFERENCES

[1] F. Liu, C. Wu, and X. Lin, Step onstruction of visual
cryptography schemes, IEEE Trans. Inf. Forensics Security,
vol. 5, no. 1, pp. 2738, Mar. 2010.

[2] R. Ito, H. Kuwakado, and H. Tanaka, Image size
invariant visual cryptography, IEICE Trans. Fundam.
Electron., Commun., Comput. Sci.,vol. 82, pp. 21722177,
Oct. 1999.

[3] M.Naor and A. Shamir, Visual cryptography, in Proc.
Advances in Cryptography (EUROCRYPT94), 1995, vol.
950, LNCS, pp. 112.


[4] Z. Zhou, G. R. Arce, and G. Di Crescenzo, Halftone
visual cryptography, IEEE Trans. Image Process., vol. 15,
no. 8, pp. 24412453,
Aug. 2006.

[5] G. Ateniese, C. Blundo, A. De Santis, and D. R.
Stinson, Visual cryptography for general access structures,
Inf. Computat., vol. 129, no. 2,
pp. 86106, Sep. 1996.

AUTHORS PROFILE


Sham Bhise pursuing
M.Tech(CSE) from Holy Mary
Institute of Technology and
Science, Hyderabad, Andhra
Pradesh, India, Affiliated to
JNTU Hyderabad.


S. Soujanya working as an Asst.
Professor, M.Tech Department of
Computer Science Engineering at
Holy Mary Institute of
Technology and Science,
Hyderabad, Andhra Pradesh,
India, Affiliated to JNTU
Hyderabad.