Cryptography Reference
In-Depth Information
TABLE 17.2
A comparison among three TiOISSSs.
TiOISSS
Our scheme
[20]
Jin et al.'s
scheme [6]
Lin
and
Lin's
scheme
[9]
Phase 1
U
U
U
the resolution
Phase 2
1
1
1
Phase 1
H
H
H
the space complexity
NO
L-T
(88 ROM)
NO
the decoding
complexity
Phase 2
the computational
complexity
L-I
(O(k))
NO
L-I
(O(k))
the pattern
G-W
B-W
B-W
the shadow
images
the shadow size
S
M
L
the file size
S
M
L
the pixel expansion
S
M
L
the progressive decryption YES YES YES
Notation: 1: Perfect reconstruction of the original image (note: for lossless version); U:
the unacceptable image quality of reconstructed image; H: stack shadows and use HVS to
preview the secret; L-I: use Lagrange interpolation for reconstruction; L-T: use a lookup table
for reconstruction; G-W: gray-and-white noise-like shadows; B-W: black-and-white noise-like
shadows; S, M, L: the values of shadow size, file size, and pixel expansion are small, medium,
and large scales, respectively.
while the value is embedded into GVCS to construct our TiOISSS. Finally,
our scheme reduces the shadow size and the file size of the shadow.
Bibliography
[1] C.C. Chang, Y.P. Hsieh, and C.H. Lin. Sharing secrets in stego images
with authentication. Pattern Recognition, 41:3130{3137, 2008.
[2] S. Cimato, R. De Prisco, and A. De Santis. Probabilistic visual cryptog-
raphy schemes. The Computer Journal, 49:97{107, 2006.
[3] P.A. Eisen and D.R. Stinson.
Threshold visual cryptography schemes
with specified whiteness.
Designs, Codes and Cryptography, 25:15{61,
2002.
Search WWH ::
Custom Search