Visual Cryptography

BY

N.SRAVANI

Example:

Secret Image Share1 Stacking the share reveals the secret

Share2

Introduction:
Cryptography:

Plain Text Plain Text

Encryption Decryption

Cipher Text Channel

Visual Cryptography:
Plaintext (in form of image) Encryption (creating shares) Channel (Fax, Email) Decryption (Human Visual System)

Visual Cryptography (cont..)

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.

Cryptosystems
plaintext message SENDER retreat at dawn encrypt ciphertext decrypt plaintext message RECEIVER retreat at dawn

key
sb%6x*cmf

key
ciphertext

Alice

Bob

ATTACKER Eve
6

The Problem Remains: How to Get the Key from Alice to Bob?
1324-5465-2255-9988
SENDER Sf&*&3vv*+@@Q

1324-5465-2255-9988 key
RECEIVER

key

AES ciphertext

(Alices Credit Card #)

The Internet

(Alices Credit Card #)

Alice (You) ATTACKER (Identity thief)

7

Bob (An on-line store) Eve

A Way for Alice and Bob to agree on a secret key

through messages that are completely public

DIFFIE-HELLMAN KEY EXCHANGE

FIRST BY

PUBLIC-KEY TYPE SCHEME PROPOSED

DIFFIE & HELLMAN IN 1976 ALONG WITH THE EXPOSITION OF PUBLIC KEY CONCEPTS A PRACTICAL METHOD FOR PUBLIC EXCHANGE OF A SECRET KEY

IS

USED

IN A NUMBER OF COMMERCIAL PRODUCTS

The basic idea of Diffie-Hellman key agreement

Arrange things so that Alice has a secret number that only Alice knows Bob has a secret number that only Bob knows Alice and Bob then communicate something publicly They somehow compute the same number Only they know the shared number -- thats the key! No one else can compute this number without knowing Alices secret or Bobs secret But Alices secret number is still hers alone, and Bobs is Bobs alone Sounds impossible

Diffie-Hellman Example
users

Alice & Bob who wish to swap keys: agree on prime q=353 and =3 select random secret keys:
A chooses xA=97, B chooses xB=233
compute
97

public keys:
shared session key as:
97

yA=3 mod 353 = 40 (Alice) 233 yB=3 mod 353 = 248 (Bob)
compute

KAB= yB mod 353 = 248 = 160 x 233 KAB= yA B mod 353 = 40 = 160

xA

(Alice) (Bob)

Diffie-Hellman Key Exchange

shared

KAB = mod q xB = yA mod q (which B can compute) x = yB A mod q (which A can compute)
KAB

session key for users A & B is KAB:

xA.xB

is used as session key in private-key encryption scheme between Alice and Bob

if

Alice and Bob subsequently communicate, they will have the same key as before, unless they choose new public-keys

Diffie-Hellman
A
Alice a Eve

B
Bob
b

Let K = B*a = A*b Alice and Bob can now use this number as a shared key for encrypted communication

Eve the eavesdropper knows A = f(a) and B = f(b)

And she also knows how to compute f and g. But going from these back to a or b requires reversing a one-way computation.

ADVANTAGE OF DH METHOD
Simple

to implement Both secret and symmetry-key are represented in binary image Even if many eavesdroppers listen over the public communication channel, we can immediately transmit a secret message to others. we enhance shadow image structure to reduce the chances for an attacker to guess the secret.

Dynamic Password

Dynamic Key Pad Layout

Secure

Visual Password for Entity Authentication Features

Dynamic keypad arrangement Dynamic shares with AI database Emergency event driven

User share Authentication share(s)

1 4 7 0

2 3 5 6 8 9 #

# 4 7 3

2 0 6 5 8 9 1

0 # 2 1

7 9 5 8 6 3 4

Program

Applications
Internet

Mobile

communication Fax machine ATM machine

Conclusions
all the features of traditional k-out-n sharing schemes Allow for perfect reconstruction of the input Bbit image Encrypts binary images Can be effectively implemented either in software or hardware Security
Preserve

Future Works
Toolkit

Implementation Combine with watermarking Forged share detection VSS chain Non-stack (Non-OR) model

Queries?