Proposal of an Asymptotically Contrast-Ideal (t, n)- Threshold Visual Secret Sharing Scheme
- 1 July 2006
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 912-916
- https://doi.org/10.1109/isit.2006.261792
Abstract
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 largeKeywords
This publication has 5 references indexed in Scilit:
- Basic Properties of the (t, n)-Threshold Visual Secret Sharing Scheme with Perfect Reconstruction of Black PixelsDesigns, Codes and Cryptography, 2006
- Determining the Optimal Contrast for Secret Sharing Schemes in Visual CryptographyCombinatorics, Probability and Computing, 2003
- Contrast Optimal Threshold Visual Cryptography SchemesSIAM Journal on Discrete Mathematics, 2003
- On the Contrast in Visual Cryptography SchemesJournal of Cryptology, 1999
- Constructions and Properties of k out of n Visual Secret Sharing SchemesDesigns, Codes and Cryptography, 1997