20-09-2012, 04:18 PM
Visual Cryptography
PPT-2.ppt (Size: 1,000 KB / Downloads: 42)
Terminology:
Pixel—Picture element
Grey Level: The brightness value assigned to a pixel; values range from black, through gray, to white.
Hamming Weight (H(V)): The number of non-zero symbols in a symbol sequence
V- Vector of 1 and 1 of any length
A qualified set of participants is a subset of Ρ whose shares visually reveal the 'secret' image when stacked together.
A forbidden set of participants is a subset of Ρ whose shares reveal absolutely no information about the 'secret' image when stacked together.
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
A Visual Cryptography Scheme (VCS) on a set Ρ of n participants is a method of encoding a 'secret' image into n shares such that original image is obtained only by stacking specific combinations of the shares onto each other.
The Model
A solution to the k out of n visual secret sharing scheme consists of two collections of n x m Boolean (Basis) matrices S0 and S1. To share a white pixel, the dealer randomly chooses one of the matrices in S0 , and to share a black pixel, the dealer randomly chooses one of the matrices in S1. The chosen matrix defines the color of the m sub pixels in each one of the n transparencies for a original pixel. The solution is considered valid if the following three conditions are met:
1. For any S in S0 , the ``or'' V of any k of the n rows satisfies H(V ) <= d-α.m
2. For any S in S1 , the ``or'' V of any k of the n rows satisfies H(V ) – d.
n-Total Participant
k-Qualified Participant
Basis Matrices
Basis matrices are binary n x m used to encrypt each pixel in the secret image, where n is the number of participants in the scheme and m is the pixel expansion. The following algorithm is used to implement a VCS using basis matrices:
If the n x m basis matrices S1 (used to encrypt black pixels) and S0 (used to encrypt white pixels) for any VCS are given, the secret image SI is encrypted as follows:
Advantage of Visual Cryptography
Simple to implement
Encryption don’t required any NP-Hard problem dependency
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 can’t predict the message.
PPT-2.ppt (Size: 1,000 KB / Downloads: 42)
Terminology:
Pixel—Picture element
Grey Level: The brightness value assigned to a pixel; values range from black, through gray, to white.
Hamming Weight (H(V)): The number of non-zero symbols in a symbol sequence
V- Vector of 1 and 1 of any length
A qualified set of participants is a subset of Ρ whose shares visually reveal the 'secret' image when stacked together.
A forbidden set of participants is a subset of Ρ whose shares reveal absolutely no information about the 'secret' image when stacked together.
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
A Visual Cryptography Scheme (VCS) on a set Ρ of n participants is a method of encoding a 'secret' image into n shares such that original image is obtained only by stacking specific combinations of the shares onto each other.
The Model
A solution to the k out of n visual secret sharing scheme consists of two collections of n x m Boolean (Basis) matrices S0 and S1. To share a white pixel, the dealer randomly chooses one of the matrices in S0 , and to share a black pixel, the dealer randomly chooses one of the matrices in S1. The chosen matrix defines the color of the m sub pixels in each one of the n transparencies for a original pixel. The solution is considered valid if the following three conditions are met:
1. For any S in S0 , the ``or'' V of any k of the n rows satisfies H(V ) <= d-α.m
2. For any S in S1 , the ``or'' V of any k of the n rows satisfies H(V ) – d.
n-Total Participant
k-Qualified Participant
Basis Matrices
Basis matrices are binary n x m used to encrypt each pixel in the secret image, where n is the number of participants in the scheme and m is the pixel expansion. The following algorithm is used to implement a VCS using basis matrices:
If the n x m basis matrices S1 (used to encrypt black pixels) and S0 (used to encrypt white pixels) for any VCS are given, the secret image SI is encrypted as follows:
Advantage of Visual Cryptography
Simple to implement
Encryption don’t required any NP-Hard problem dependency
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 can’t predict the message.