论文信息 - Visual Cryptography (VC) with non-expanded shadow images: Hilbert-curve approach

Visual Cryptography (VC) with non-expanded shadow images: Hilbert-curve approach

Visual cryptography (VC) was introduced by Naor and Shamir. In general, a (k, n)-threshold scheme shares a given secret image S among n so-called shadow images. People can "view" the secret image by simply stacking any k of these n shadows (k < n is a threshold value). In most of the reported VC schemes, the size of each shadow is greater than that of S. This paper, we use Hilbert curve and two queues to present a VC scheme with the following properties: (1). Each shadow image is as small as the input image S. (2). Many gracious (k, n) contrast-optimal algorithms can be directly and easily applied to our scheme. (3) Image quality is competitive.

Ja-Chen Lin | Wen-Pinn Fang | Sen-Jen Lin

[1] D. Hilbert. Ueber die stetige Abbildung einer Line auf ein Flächenstück , 1891 .

[2] Chang-Chou Lin,et al. Secret Multimedia Information Sharing with Data Hiding Capacity by Simple Logic Operations , 2001, ISAS-SCI.

[3] Moni Naor,et al. Visual Cryptography , 1994, Encyclopedia of Multimedia.

[4] Moni Naor,et al. Visual cryptography for grey level images , 2000, Inf. Process. Lett..

[5] Ching-Nung Yang,et al. New visual secret sharing schemes using probabilistic method , 2004, Pattern Recognit. Lett..

[6] R. Ito,et al. Image Size Invariant Visual Cryptography , 1999 .

[7] Hans Ulrich Simon,et al. Contrast-optimal k out of n secret sharing schemes in visual cryptography , 2000, Theor. Comput. Sci..

[8] Chang-Chou Lin,et al. Visual cryptography for gray-level images by dithering techniques , 2003, Pattern Recognit. Lett..

[9] Alfredo De Santis,et al. On the Contrast in Visual Cryptography Schemes , 1999, Journal of Cryptology.