A New Cheating Prevention Scheme For Visual Cryptography

Jun 8 2006 Du-Shiau Tsaiab,Tzung-her Chenc and Gwoboa Hornga aDepartment of Computer Science, National Chung Hsing University bDepartment of Information Management, Hsiuping institue of Technology cDepartment of Computer Science and Information Engineering, National Chiayi University

Conspectus

Abstract Visual Cryptography Cheating in Visual Cryptography VC Cheating Protection Scheme Simulated Results Conclusion

Abstract

Naor and Shamir proposed the (k,n) Visual Cryptography(VC for short) scheme in 1995, and has been used in numerous applications. In 2006, Horng et al. proposed that cheating is possible in VC. In this study, a new scheme used Generic Algorithms(GA for short) is proposed to solve the cheating problem.
3

Visual Cryptography

The nm subpixels is described as an nm boolean matrix S=[Sij] such that Sij = 1 if and only if the jth subpixel of the ith share is black. A solution to the (k,n) VC scheme consists of two collections of nm boolean matrices C0(For white) and C1(For black). The solution is considered valid if the following three conditions are met 1.H(V) d-*m in C0 2.H(V) d in C1 3.For any subset {i1,i2,,iq} of {1,2,,n} with q < k, the two collections of qm matrices Dt for t{0,1} obtained by restricting each nm matrix in Ct (where t=0,1) to rows i1,i2,,iq are indistinguishable in the sense that they contain the same matrices with the same frequencies.
4

Cheating in Visual Cryptography

Horng et al. proposed that cheating is possible in (k,n) VC when k is smaller than n. The key point of cheating is how to predict and rearrange the positions of black and white subpixels in the victims and cheaters share. Figure 1. shows the whole cheating process and Table 1. shows the cheaters create to change the decoded image.
5

Figure 1.: the cheating process

Pixel in Secret Image

Case1 Case2 white white

Pixel in Share Share Share Share Share pixel in pixel in pixel in Cheating pixel in pixel in Share SA Share SB Share SC Image Share SA Share SB
[1 0 0] [1 0 0] [1 0 0] [1 0 0] [1 0 0] [1 0 0] white black [1 0 0] [0 1 0] [1 0 0] [0 0 1]

Case3

black

[1 0 0]

[0 1 0]

[0 0 1]

white

[0 0 1]

[0 0 1]

Case4

black

[1 0 0]

[0 1 0]

[0 0 1]

black

[1 0 0]

[0 1 0]

Table 1.: The concept of cheating in VC

VC Cheating Protection Scheme(1)

Figure 2. shows the process to proposed scheme. First, The rotation process turns SI with n C different degrees of angle to generate 2 SI. Second, used GA to proposed scheme.

Figure 2. The sketch of proposed scheme

VC Cheating Protection Scheme(2)

Population
Individual 1 Individual 2 Individual 3
...

Fitness Function Simulation environment Transmutation stop yes or no?

New generation

MatingPool

Reproduction

Crossover

Mutation Figure 3.GA Process

9

VC Cheating Protection Scheme(3)

Figure 4. The chromosomes

10

VC Cheating Protection Scheme(4)

IF H(V j) = EV THEN

j= 1 ELSE j = 0, where j = 1,2,,n

IF H(g(i1 ,i2 ) ) satisfy SV (i1 ,i2 ) THEN

(i1 ,i2 ) = 1 else (i1 ,i2 ) = 0, where i 1 < i 2 < n

n 1 fitness value = (i ,i ) j * 1 2 2

Fitness function algorithm

11

Simulated Results(1)

Figure 5. Decoded images in the (2, 4) cheating prevention scheme

12

Simulated Results(2)

Figure 7: Results of simulated cheating attack.

13

Conclusion

The proposed scheme does against the cheating attack in VC. The GA based share construction method provides another direction for creating shares.

14