Visual Cryptography
Visual Cryptography
Contents:
Introduction
How
Visual Cryptography works Security issues Types of cheaters in Visual Cryptography Cheating prevention Algorithm Advantages of Visual Cryptography Conclusion
Introduction:
Cryptography:
Encryption Decryption
Visual Cryptography:
Plaintext (in form of image) Encryption (creating shares) Channel (Fax, Email) Decryption (Human Visual System)
Example:
Share2
Visual Cryptography
Visual Cryptography is a secret-sharing method that encrypts a secret image into several shares but requires neither computer nor calculations to decrypt the secret image. Instead, the secret image is reconstructed visually: simply by overlaying the encrypted shares the secret image becomes clearly visible
we can now create the two layers. one transparent image, layer 1, has pixels which all have a random state, one of the possible states. layer 2 is identical to layer 1, these pixels have a state that is opposite to the layer1 if both images are overlayed, the areas with identical states will look gray, and the areas with opposite states will be black.
Encoding of Pixels:
Original Pixel
share1
share2 s1= s0=
overlaid Image
security issues:
vc is used for secure communications. the sender will distribute one or more random layer 1 in advance to the receiver. if the sender has a msg, he creates a layers 2 for a particular distributed layer 1 and sends it to the receiver. the receiver aligns the two layers & secret information is revealed. if one of both layer is intercepted its impossible to retrieve the encrypted information.
1) 2)
Cheating a VC by an MP Cheating a VC by an MO
1. Cheating a VC by an MP:
The
fig:
2. Cheating a VC by an MO:
The
fig:
The contrast of the secret image in the stacking of shares is not reduced significantly in order to keep the quality of VC. A cheat-preventing method should be applicable to any VCS.
Simple to implement It provides more security. If an image was broken up into n shares so that only someone with all n shares could decrypt the image, while any n-1 shares revealed no information about the original image. Decryption algorithm not required (Use a human Visual System). So a person unknown to cryptography can decrypt the message. We can send cipher text through FAX or E-MAIL Infinite Computation Power cant predict the message.
Conclusion:
In order to hide the secrecy we go for expansion and increasing of the number of shares, but this affects the resolution. Therefore an optimum number of shares are required to hide the secrecy. At the same time security is also an important issue. Hence research in VC is towards maintaining the contrast at the same time maintaining the security.