Constructions and Properties of k out of nVisual Secret Sharing Schemes
Designs, Codes and Cryptography
Contrast-optimal k out of n secret sharing schemes in visual cryptography
Theoretical Computer Science - computing and combinatorics
Threshold Visual Cryptography Schemes with Specified Whiteness Levels of Reconstructed Pixels
Designs, Codes and Cryptography
Improved Schemes for Visual Cryptography
Designs, Codes and Cryptography
Contrast Optimal Threshold Visual Cryptography Schemes
SIAM Journal on Discrete Mathematics
Determining the Optimal Contrast for Secret Sharing Schemes in Visual Cryptography
LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
New Results on Visual Cryptography
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
Designs, Codes and Cryptography
Visual Secret Sharing Schemes with Cyclic Access Structure for Many Images
Information Security and Cryptology --- ICISC 2008
A new definition of the contrast of visual cryptography scheme
Information Processing Letters
Visual cryptography schemes with dihedral group access structure for many images
ISPEC'07 Proceedings of the 3rd international conference on Information security practice and experience
Step construction of visual cryptography schemes
IEEE Transactions on Information Forensics and Security
A general method for construction of (t, n)-threshold visual secret sharing schemes for color images
Designs, Codes and Cryptography
Improving the visual quality of size invariant visual cryptography scheme
Journal of Visual Communication and Image Representation
On the equivalence of two definitions of visual cryptography scheme
ISPEC'12 Proceedings of the 8th international conference on Information Security Practice and Experience
Flexible visual cryptography scheme without distortion
IWDW'11 Proceedings of the 10th international conference on Digital-Forensics and Watermarking
A secret enriched visual cryptography
IWDW'12 Proceedings of the 11th international conference on Digital Forensics and Watermaking
| Hi-index | 0.00 |
This paper provides a new method for construction of the generating (or basis) matrices of the (t, n)-threshold visual secret sharing scheme ((t, n)-VSSS) for any n 驴 2 and 2 驴 t 驴 n. We show that there exists a bijection between a set of generating matrices of the (t, n)- VSSS and a set of homogeneous polynomials of degree n satisfying a certain property. We also show that the set of homogeneous polynomials is identified with a set of lattice points in a linear space of dimension n - t + 1 with explicitly expressed bases. These results yields a general formula of the generating matrices of the (t, n)-VSSS. The formula is not only theoretically of interest but also enables us to obtain efficient generating matrices that have been unknown.