Scribd
Upload
3 views10 pages

On the Relation of Random Grid and NETWORKS

The document discusses a Visual Cryptography Scheme (VCS) that enhances data security by encoding secret images into multiple shadow images, focusing on minimizing pixel expansion and maximizing contrast. It proposes a novel construction for Random Grid and Deterministic Visual Cryptography, demonstrating improved results over existing methods. The proposed system also includes password protection and pixel rearrangement for secure image transmission.

Uploaded by

arunasekaran
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
3 views10 pages

On the Relation of Random Grid and NETWORKS

The document discusses a Visual Cryptography Scheme (VCS) that enhances data security by encoding secret images into multiple shadow images, focusing on minimizing pixel expansion and maximizing contrast. It proposes a novel construction for Random Grid and Deterministic Visual Cryptography, demonstrating improved results over existing methods. The proposed system also includes password protection and pixel rearrangement for secure image transmission.

Uploaded by

arunasekaran
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 10

Visual Cryptography Schemes with

Optimal Pixel Expansion

Project Members Project Guide


R.S.Mohan Krishna R.Rajarajeshwari,
R.Chan Basha Asst Professor/CSE,
K.Surendar SKPIT.
Abstract

• Visual Cryptography Scheme (VCS) is an encryption method used to encode


secret written materials. The idea is to convert the written material into a
binary image and encode this image in to n shadow image it is also called as
shares of images.
• The decoding only requires selecting some subset of these n shadow images,
making transparencies of them and stacking them on top of each other. Main
advantage of this scheme is mathematical computation complexity is reduced
to visual cryptographic techniques.
• Each participant holds a transparency. Most of the previous research work on
VC’s focuses on two parameters: large pixel expansion and contrast.
• Further, the number of sub pixels (m) for encoding each secret pixel,
referred to as the pixel expansion, is the smaller the enhanced to reduce the
share size.
Con…
• The pixel expansion and relative contrast are the most critical
measurements to evaluate the effectiveness of a VCS. In this paper, we
studied the in VC in addition to Deterministic Visual Cryptography
(DVCS) can achieve the minimum pixel expansion and the maximal
contrasts.

• We develop a novel and efficient construction for Random Grid and


DVCS in this paper. The proposed Visual Cryptograms of Random Grids
model and deterministic model aims at the minimization of the pixel
expansion and maximal contrasts for individual a VC.
• The Experimental results demonstrate the feasibility, applicability, and
flexibility of our construction. The pixel expansions and contrasts derived
from our scheme are also better than the previous results.
Existing system:

• Data security has been a challenging task in visual cryptography system


and database systems.

• The existing visual cryptography schemes that are used for data hiding
have a security hole in the encrypted Share file.

• Each participant holds a transparency. Most of the previous research work


on VC’s focuses on two parameters: large pixel expansion and contrast.

• The pixel expansion and relative contrast are the most critical
measurements to evaluate the effectiveness of a VCS.
Disadvantages:

• The existing system does not provide a friendly environment to encrypt or


decrypt the data (images).

• The existing system supports with only one type of image format only. For
example, if it is .jpg, then it supports only that same kind of image format
only.
Proposed system

• We are able to improve several schemes and to provide many upper bounds for
the random grid model and by exploiting some results known for the random grid
model, we are also able to provide new schemes for the deterministic model.

• The pixel expansions and contrasts derived from our scheme are also better than
the previous results.

• First, an image is split into “n” encrypted shares using algorithm by the fact that a
pixel can be split into sub pixels.

• Second, in order to avoid hacking of shared image, we employ password


protection for each share using Embedded algorithm and simple Arithmetic
Encoding compression technique which compresses the pass code.

• Third, we perform rearranging of pixels of shared image by overlaying process to


obtain the access to the protected data’s.
Advantages

• Secret Images can be sent using the visual


cryptography.
• Images are partitioned with pixels and sub-pixels
using matrix method.
• Secured tramission of Image without any violation in
data.
SOFTWARE REQUIREMENTS

• Platform : JAVA (JDK 1.5)

• Front End : JAVA Swing

• IDE : NETBEANS 6.9

• Operating System : Microsoft Windows 2000 or XP


HARDWARE REQUIREMENTS

• Processor : Pentium IV Processor


• RAM : 512 MB
• Monitor : 14” VGA COLOR MONITOR
• Keyboard : 104 Keys
REFERENCES

[1] A. Adhikari and S. Sikdar, “A new (2,n)-visual threshold scheme for


color images,” in Proc. 4th Int. Conf. Cryptol., Dec. 2005, pp. 148–161.
[2] G. Ateniese, C. Blundo, A. De Santis, and D. R. Stinson, “Visual
cryptography for general access structures,” Inf. Comput., vol. 129, no. 2,
pp. 86–106, Sep. 1996.
[3] G. Ateniese, C. Blundo, A. De Santis, and D. R. Stinson, “Extended
schemes for visual cryptography,” Theoretical Comput. Sci., vol. 250,
pp. 143–161, Aug. 2001.
[4] C. Blundo, S. Cimato, and A. De Santis, “Visual cryptography schemes
with optimal pixel expansion,” Theoretical Comput. Sci., vol. 369,
nos. 1–3, pp. 169–182, Dec. 2006.
[5] C. Blundo, A. De Bonis, and A. De Santis, “Improved schemes
for visual cryptography,” Des., Codes Cryptogr., vol. 24, no. 3,
pp. 255–278, Dec. 2001.

You might also like