19-06-2013, 01:03 PM
Secret Image Sharing Using Pseudo-Random Sequence
Secret Image Sharing.pdf (Size: 105.36 KB / Downloads: 20)
Summary
We propose a new concept which is derived from the
cryptography, the substitution of bits in the image and the visual
cryptography method. Given some secret data and a set of cover
images, in the proposed scheme the secret data is encrypted by
the administrator, after that we select the random bit planes of
the cover images using the pseudo-random sequence and modify
the cover image based on these random bit planes. In our method
each participant has a unique modified cover image called stegoimage.
Therefore these participants are required to reconstruct
the encrypted secret data without destroying of its secrecy. After
that administrator decrypt the original data. Experiments show
the good quality of the stego-image. The proposed scheme also
prevents anyone if steal all the shares will not gaining
information about the secret data.
Introduction
In the present era of computers and fast communication,
one needs to protect communicated information (message
or plain text) from unauthorized user, while sending it
through any electronic media. The private-key and the
public-key are the two well-known cryptosystems [1, 2, 3,
4, 5, 6, and 7] using these we enable to keep the secret
data securely in such a way that that invader cannot able to
understand what the secret data means. The data
encryption standard (DES) [6, 7] and Rivest, Shamir,
Adleman (RSA) and Advanced Encryption Standard
(AES) [1, 2, 3, 4, and 5] are three representative methods.
Apart from cryptography, steganography provides another
way to keep the data secure. The Steganography [8, 9, 10,
11, 12, 13, 14, 15, and 16] consists of techniques to allow
the communication between two persons. It hides not only
the contents but also the existence of the communication
in the eyes of any observer. These techniques use a second
perceptible message, with meaning disjoined by the secret
message. This second message works as a “Trojan horse”,
and is a container of the first one.
Secret Image Sharing using Pseudo-
Random Sequence
Suppose the dealer wants two participants 1 P and 2 P to
share the secret original data T and first we encrypt the
secret data as E which is encrypted by the administrator.
Then we will share this encrypted data E . We are taking
the digital grayscale image in which each pixel of 8-bits or
1-byte, representing the gray levels from black to white.
The encrypted text to be hidden is E and two image X1
and X2 in which we will share the encrypted data. We will
take two pseudo-random sequences which is generated by
the NLFFSR. Let the sequences generated are 1 S and 2 S .
Conclusion
The main purpose of our proposed scheme is to make a
full-proof method. We provide the concept of the
administrator in the secret sharing as well the encryption
of the original data. And we are also using the concept of
the pseudo-random sequence to make our proposed
scheme our secure from any attack. Our method is much
better than the Visual Cryptography because the cover
images do not have to be expanded and this prevents the
disorderliness and the spots of the shadows on the images.
And it is very tough to break this proposed scheme even
by any computer of this age.