论文信息 - Proposal of an Asymptotically Contrast-Ideal (t, n)- Threshold Visual Secret Sharing Scheme

Proposal of an Asymptotically Contrast-Ideal (t, n)- Threshold Visual Secret Sharing Scheme

This paper is concerned with a variation of the (t, n)-threshold visual secret sharing scheme ((t, n)-VSSS for short). In the (t, n)-VSSS a secret image is encrypted to n images called shares. While we can reproduce the secret image by stacking arbitrary t shares, no information is revealed from less than t shares. We consider a new (t, n)-VSSS in which stacking more than t shares enables us to recognize a secret image more clearly than stacking just t shares. In particular, for the cases of t = 2, 3,4, 5 we can prove the existence of basis matrices of the (t, n)-VSSS that almost perfectly reproduces a secret image when all the n shares are stacked if n is sufficiently large

Hiroki Koga | Etsuyo Ueda

[1] Hans Ulrich Simon,et al. Determining the Optimal Contrast for Secret Sharing Schemes in Visual Cryptography , 2000, Combinatorics, Probability and Computing.

[2] Eric R. Verheul,et al. Constructions and Properties of k out of n Visual Secret Sharing Schemes , 1997, Des. Codes Cryptogr..

[3] Kaoru Kurosawa,et al. Almost Ideal Contrast Visual Cryptography with Reversing , 2004, CT-RSA.

[4] Hiroki Koga. A General Formula of the (t, n)-Threshold Visual Secret Sharing Scheme , 2002, ASIACRYPT.

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

[6] Hiroki Koga,et al. Basic Properties of the (t, n)-Threshold Visual Secret Sharing Scheme with Perfect Reconstruction of Black Pixels , 2006, Des. Codes Cryptogr..

[7] Hirosuke Yamamoto,et al. An Analytic Construction of the Visual Secret Sharing Scheme for Color Images , 2001 .

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

[9] Alfredo De Santis,et al. Contrast Optimal Threshold Visual Cryptography Schemes , 2003, SIAM J. Discret. Math..