Scribd
Upload
123 views

Visual Cryptography.4003826.Powerpoint

This document provides an overview of visual cryptography, including: - An introduction to cryptography and how visual cryptography works - The types of visual cryptography including general k out of n schemes - An example of a (2,2) visual cryptography scheme - The implementation of visual cryptography which encrypts pixels into shares that can be decrypted by human visual system - Advantages of visual cryptography including no need for cryptographic computations or encryption/decryption algorithms.

Uploaded by

Jfj Erthf
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
123 views

Visual Cryptography.4003826.Powerpoint

This document provides an overview of visual cryptography, including: - An introduction to cryptography and how visual cryptography works - The types of visual cryptography including general k out of n schemes - An example of a (2,2) visual cryptography scheme - The implementation of visual cryptography which encrypts pixels into shares that can be decrypted by human visual system - Advantages of visual cryptography including no need for cryptographic computations or encryption/decryption algorithms.

Uploaded by

Jfj Erthf
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 16

CONTENTS

 INTRODUCTION TO CRYPTOGRAPHY
 INTRODUCTION TO VISUAL CRYPTOGRAPHY
 OVERVIEW OF VISUAL CRYPTOGRAPHY
 TYPES OF VISUAL CRYPTOGRAPHY
 ADVANTAGES
 DISADVANTAGES
 APPLICATIONS
 CONCLUSION
 REFERENCES
INTRODUCTION
What is Cryptography ?

Plain Text/image Encryption Cipher

Plain Text /image Decryption Channel


TYPES OF CRYPTOGRAPHY:
VISUAL CRYPTOGRAPHY
What is Visual Cryptography ?

 Visual cryptography is a cryptographic technique which


allows visual information (pictures, text, etc.) to be
encrypted in such a way that the decryption can be
performed by the human visual system.

 Visual cryptography was pioneered by Moni Naor and


Adi Shamir in 1994
Suppose the data D is divided into n shares
 D can be constructed from any k shares out of n

 Complete knowledge of k-1 shares reveals no


information about D
 k of n shares is necessary to reveal secret data.
EXAMPLE

 6 thieves share a bank account


 They don’t trust one another

 The thieves split up the password for the account in


such a way that:
 Any 3 or more thieves working together can have
access to account, but NOT < 3.
OVERVIEW OF V.C
Share1

Stacking the share


reveals the secret

Share2

Encryption Decryption
GENERAL K OUT OF K SCHEME
 Matrix size = k x 2k-1
 S0 : handles the white pixels
 All 2k-1 columns have an even number of 1’s

 S1 : handles the black pixels


 All 2k-1 columns have an odd number of 1’s
BASIS MATRICES
 The two matrices S0,S1 are called basis matrices, if the
two collections C0,C1 as defines in [1] are obtained by
rearranging the columns of S0,S1 satisfy the following
condition:

the row vectors V0,V1 obtained by performing


OR operation on rows i1,i2,…..iv of S0,S1 respectively,
satisfy
(V0) ≤ tX - (m) m and (V1) ≥ tX
 Where tx is the threshold to visually interpret pixel as
black or white.

tX = min((V1(M)))

 (m) is the contrast or relative difference

(m) = {min((V1(M))) - max((V0(M)))}  m


Example: the basis matrices and the collections of the encoding
matrices in the conventional (2,2) scheme can be written as:

Here, the pixel expansion is m=2. For any matrix M  C0, the row
vector V0= OR (r1,r2) satisfies (V0) =1. For any M  C1, the row
vector V1= OR (r1,r2) satisfies (V1) =2.
The threshold is given by:

tX = min((V1(M))) = 2

Having a relative difference:

(m) = {min((V1(M))) - max((V0(M)))}  m = 1/2


IMPLEMENTATION

FIG 1
 A pixel P is split into two sub pixels in each of the two
shares.
• If P is white, then a coin toss is used to randomly
choose one of the first two rows in the figure above.
• If P is black, then a coin toss is used to randomly
choose one of the last two rows in the figure above.
 Then the pixel P is encrypted as two sub pixels in each
of the two shares, as determined by the chosen row in the
figure. Every pixel is encrypted using a new coin toss.
 Now let's consider what happens when we superimpose
the two shares.
• If P is black, then we get two black sub pixels when we
superimpose the two shares;
 If P is white, then we get one black sub pixel and one white
sub pixel when we superimpose the two shares.
 Thus, we can say that the reconstructed pixel (consisting of
two sub pixels) has a grey level of 1 if P is black, and a grey
level of 1/2 if P is white. There will be a 50% loss of contrast
in the reconstructed image, but it is still visible.
Interesting, right?
This is just a sneak preview of the full presentation. We hope you like it!
To see the rest of it, just click here to view it in full on PowerShow.com.
Then, if you’d like, you can also log in to PowerShow.com to download
the entire presentation for free.

You might also like