Cryptography Reference
In-Depth Information
FIGURE 10.7
HCT2.
guess the structure of victim's transparency is negligible. The idea can be
extended to design a k-out-of-(n + l) cheating prevention scheme.
10.3.2 HT
The core of HT, shown in
Figure 10.8,
uses a generic transformation to create
new transparencies by adding two subpixels to every block of every original
transparency. Then, HT creates a verification transparency for each partici-
pant such that the stacking result of the new transparency with the verifica-
tion transparency will reveal a verification image. Therefore, HT is a share-
authentication-based cheating prevention scheme. Basically, HT will perform
the following steps with input C
0
and C
1
to create verification transparencies
2
4
3
5
and T
1
=
2
4
3
5
10
. C
0
10
10
. C
1
10
1. Let T
0
=
2. Use T
0
and T
1
as the base matrices for creating transparencies
3. For each participant Pi,
i
, choose a verification image and create a verification
transparency v
i
as follows:
Search WWH ::
Custom Search