ROTATIONAL VISUAL CRYPTOGRAPHY FOR MULTIPLE SECRET IMAGES USING BASIC (2,2) SCHEME

Project Seminar by: Prasad B.S. 5ZD09SPZ09

Under the guidance of: Prasanna Kumar H.R. Assistant Professor Department of Computer Science & Engineering N.M.A.M. Institute of Technology, Nitte-574 110

OVERVIEW
INTRODUCTION BASIC SCHEMES RELATED WORKS PROPOSED SCHEME IMPLEMENTATION EXPERIMENTAL RESULTS CONCLUSION REFERENCES

INTRODUCTION
CRYPTOGRAPHY? PLAINTEXT ENCRYPTION CIPHERTEXT

PLAINTEXT

DECRYPTION

CHANNEL

VISUAL CRYPROGRAPHY
It is a cryptographic technique which allows visual information (pictures, text, etc.) to be encrypted using secret sharing in such a way that the decryption can be performed by humans with no mathematical computations or knowledge of cryptography.

BASIC SCHEMES
Eurocrypt 94: Naor and Shamir - Visual Cryptography[2]
Image split into 2 shares Decoding = stacking transparencies Perfectly secure, 1 share contains no information about image

Extended to k out of n sharing problem

Image split into n shares Any k stacked together reveal image Perfectly secure, any k..1 shares contain no information

BASIC (2,2) SCHEME

A pixel P is split into two sub pixels in each of the two shares.

RELATED WORKS (Multiple images)

Most of the visual cryptography studies concentrated on sharing the single secret.

Bin Yu, Xiaohui Xu, Liguo Fang [3] solved this problem by introducing a Multi secret scheme in which the combination of different shares results in different secret images. Lina Ge, Shaohua Tang [4] gave the solution to share multi secrets based on circle properties.
Later Weir, WeiQi Yan [5] introduced a new scheme to share multiple secrets with the help of generating master key.

RELATED WORKS (Rotational )

Wu and Chens [6] introduced a new concept of rotation to share multiple secrets with a method RVCS in which two secret images are encrypted into two shares and the decryption is done by combining two shares with different angles. The scheme was limited to encrypt two images only. Wu and Chang [7] renewed the idea of Wu and Chen by consciously designing the encoded shares to be circles so that the restrictions to the rotating angles ( = 90, 180, or 270) can be removed.

Related works-Comparison
Scheme Wu and Chan Wu and Chang Feng et. Al. Shyu et. Al. Bin Yu et. Al. Proposed x= No. of secret images x 2 2 >=2 >=2 2 3 m 4 4 3*x 2*x 2 2 m=pixel expansion Contrast 1/4 1/4 1/3x 1/2x 1/2 1/2 Shares shape Square Square Cylinder Cylinder or Circle Rectangle Rectangle

PROPOSED SCHEME
This project proposes and implements a Rotation Visual Cryptography for multiple secret images using basic (2,2) scheme which encrypts three secret images into three shares and each secret image can be easily revealed by overlaying one share with the 1800 anticlockwise rotation of another share. In this way the combination of any of the two shares reveals one secret image with the help of 1800 anticlockwise rotation.

IMPLEMENTATION

PHASE I : Adding noise

Selection of six secret pixel units.

Image 1

Image 2

Image 3

0 1

1 2

0 3

1 4

0 5

0 6

PHASE I : Adding noise

If the selected 6 secret pixels contains odd number of black pixels (1s) then the proposed algorithm doesnt work. To avoid this problem some noise is to be added to three secret images in the form of converting one white pixel to black pixel to make the odd number of black pixels to even number of black pixels in the selected 6 pixels. Select the white pixel which has the maximum number of neighbouring white pixels.

PHASE II : Generate shares

Reconstruction of secret pixels depends on the positions in the shares. Secret pixel 1 depends on the 1st and 2nd positions in share1 and share2 respectively. Similarly secret pixel2 depends on the 2nd and 3rd positions and secret pixel3 depends on the 3rd and 4th positions and secret pixel4 depends on the 4th and 5th positions and secret pixel5 depends on the 5th and 6th positions and secret pixel6 depends on the 6th and 1st positions.

Three Secret Images with Pixel Positions And Their Corresponding Values

Algorithm
for i:= 0 to h do p:= 0,q:= 2*w-1,n:= w-1; for j:= 0 to w/2 do //i till number of rows //j till half of the number of columns

if i1(i,j):= 1 then // if the pixel of image 1 is black s1(i,p):= 0; s1(i,p+1):= 1; //share1 s2(i,q):= 1; s2(i,q-1):= 0; //share2 a:= 0; else s1(i,p):= 0; s1(i,p+1):= 1; // share1 s2(i,q):= 0; s2(i,q-1):= 1; //share2 a:= 1; End //if ..

PHASE III: Decryption

Each secret image could be obtained by super -imposing one share with the 1800 anticlockwise rotation of another share.

The first pixel (1') in the first share is overlapped with the last pixel of second share (3) and the second pixel (2) in the first share is overlapped with the last but one pixel (4) of second share and so on.
The same is repeated for the remaining rows of two shares. This process is called superimposition of one share with the 180 degrees anticlockwise rotation of another share.

Human visual system as OR operation

Reconstructed Image = First Share (+) anticlockwise (Second Share )

Algorithm
Begin: Input : Three shares S1,S2,S3. Output : Three secret images f1,f2,f3. h:=row size of secret images; w:=column size of secret images; for i:=0 to h //i till number of row for j:=0 to 2*w, l:=2*w-1 to 0 do //j till twice the width of column, l from twice the width of column f1(i,j):=s1(i,j)|s2(i,l); //or share 1 and rotated share 2 f2(i,j):=s2(i,j)|s3(i,l); f3(i,j):=s3(i,j)|s1(i,l); End j,l loop End i loop End Algorithm

EXPERIMENTAL RESULTS
Secret images (240 x 100)

Secret Image 1

Secret Image 2

Secret Image 3

Phase I: Noise added images

Noise added Image 1 Noise added Image 2

Noise added image 3

Phase II: Shares Generated(480x110)

Shares generated using noise added images

Phase III: Decrypted images

Share1 (+) anticlockwise (Share2) = Secret Image

Share2 (+) anticlockwise (Share3) = Secret Image

Share3 (+) anticlockwise (Share1) = Secret Image

CONCLUSION
The proposed scheme offers a more efficient and effective way to share multiple secrets. Reducing the demand of image transmission bandwidth. Easing the management overhead of meaningless share images. Involving neither significant extra computational cost nor too much distortion for reconstructed secret images. Applied into image hiding schemes, this scheme can enhance the hiding capacity.

REFERENCES
[1] Rotation Visual Cryptography Using Basic (2, 2) Scheme : Dinesh Reddy et .al.TECHNIA International Journal of Computing Science and Communication Technologies, VOL. 3, NO. 2, Jan. 2011. (ISSN 09743375) [2] M. Naor and A. Shamir Visual cryptography, Advances in cryptology EUROCRYPT 94. Lecture notes in Computer Science, (950):112, 1995.

[3] B. Yu, X. Xu, L. Fang. Multi-secret Sharing Threshold Visual Cryptography Scheme. International Conference on Computational Intelligence and Security, 2007. [4] L. Ge, S. Tang, Sharing Multi-secret Based on Circle Properties, 2008 International Conference on Computational Intelligence and Security. [5] J. Weir, W-Q Yan, Sharing Multiple Secrets Using Visual Cryptography, 978-1-244-3828-0/09/, 2009 IEEE. [6] C.C. Wu and L.H. Chen. A study on visual cryptography, Master Thesis. PhD thesis, Institute of Computer and Information Science, National Chiao Tung University, Taiwan, R.O.C., 1998. [7] H.-C. Wu and C.-C. Chang. Sharing visual multi-secrets using circle shares. Comput. Stand. Interfaces, 134 (28):123{135, 2005.

Thank you