Data Hiding in Image Size Invariant Visual Cryptography

The 3rd International Conference on Innovative Computing Information and Control (ICICIC'08), June 2008, pp. 25-25 Authors Hao Luo and Faxin Yu Speaker Wei-Chiang Kao Date 2009/06/19
1

Source

Outline     Introduction Proposed scheme Experimental results Conclusions 2 .

Introduction (1/2)  Visual Cryptography (Naor and Shamir. 1994) Share1 A Secret image Stacking result Share2 B 3 .

Introduction (2/2)  Construction rules secret S1 S2 stacking C0 C1 4 .

Proposed scheme (1/3)  Construction rules secret S1 S2 stacking XOR C0 C1 5 .

Proposed scheme (2/3) secret 1 2 watermark 3 4 1 3 5 7 2 4 6 8 share 1 5 6 7 8 share 2 6 .

Proposed scheme (3/3) watermark secret share 1 share 2 stacking XOR XOR stacking result XOR result 7 .

Experimental results secret image original watermark share 1 share 2 stacking results reconstructed results extracted watermark 8 .

9 .Conclusions    A simple visual secret sharing scheme that it¶s not expanding the size of share images. The secret image and hidden image can be reconstructed losslessly with simple logical operations. An image can be hidden in two shares images during the share construction phase.

Sign up to vote on this title
UsefulNot useful