Constructions and Properties of k out of nVisual Secret Sharing Schemes
Designs, Codes and Cryptography
Concrete Mathematics: A Foundation for Computer Science
Concrete Mathematics: A Foundation for Computer Science
Visual Authentication and Identification
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Jack van Lint (1932-2004): a survey of his scientific work
Journal of Combinatorial Theory Series A - Special issue in honor of Jacobus H. van Lint
A new definition of the contrast of visual cryptography scheme
Information Processing Letters
Step construction of visual cryptography schemes
IEEE Transactions on Information Forensics and Security
A comprehensive study of visual cryptography
Transactions on data hiding and multimedia security V
Secret image sharing with authentication-chaining and dynamic embedding
Journal of Systems and Software
Real perfect contrast visual secret sharing schemes with reversing
ACNS'06 Proceedings of the 4th international conference on Applied Cryptography and Network Security
Authenticating visual cryptography shares using 2d barcodes
IWDW'11 Proceedings of the 10th international conference on Digital-Forensics and Watermarking
Random grid-based visual secret sharing with abilities of OR and XOR decryptions
Journal of Visual Communication and Image Representation
XOR-based meaningful visual secret sharing by generalized random grids
Proceedings of the first ACM workshop on Information hiding and multimedia security
| Hi-index | 0.00 |
A recent publication introduced a Visual Crypto (VC) system, based on the polarisation of light. This VC system has goodresolution, contrast and colour properties.Mathematically, the VC system is described by the XOR operation (modulo two addition). In this paper we investigate Threshold Visual Secret Sharing schemes associated to XOR-based VC systems. Firstly, we show that n out of n schemes with optimal resolution and contrast exist, and that (2,n) schemes are equivalent to binary codes. It turns out that these schemes have much better resolution than their OR-based counterparts. Secondly, we provide two explicit constructions for general k out of n schemes. Finally, we derive bounds on the contrast and resolution of XOR-based schemes. It follows from these bounds that for kn, the contrast is strictly smaller than one. Moreover, the bounds imply that XOR-based k out of n schemes for even k are fundamentally different from those for odd k.