A General Formula of the (t, n)-Threshold Visual Secret Sharing Scheme
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Aspect ratio invariant visual secret sharing schemes with minimum pixel expansion
Pattern Recognition Letters
Visual Secret Sharing Schemes with Cyclic Access Structure for Many Images
Information Security and Cryptology --- ICISC 2008
Journal of Combinatorial Optimization
Improving the visual quality of size invariant visual cryptography scheme
Journal of Visual Communication and Image Representation
Compatible ideal contrast visual cryptography schemes with reversing
ISC'05 Proceedings of the 8th international conference on Information Security
A new black and white visual cryptographic scheme for general access structures
INDOCRYPT'04 Proceedings of the 5th international conference on Cryptology in India
Improvements of a two-in-one image secret sharing scheme based on gray mixing model
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
Visual secret sharing with cheating prevention revisited
Digital Signal Processing
Graph access structures with optimal pixel expansion three
Information and Computation
A secret enriched visual cryptography
IWDW'12 Proceedings of the 11th international conference on Digital Forensics and Watermaking
On (k, n)*-visual cryptography scheme
Designs, Codes and Cryptography
| Hi-index | 0.00 |
Naor and Shamir ([1]) defined the basic problem of visual cryptography by a visual variant of the k out, of n secret sharing problem: how can an original picture be encoded by n transparencies so that less than k of them give no information about the original, but by stacking k of them the original can be seen? They described a solution to this problem by a structure called k out of n secret sharing scheme whose parameters directly correspond to quality and usability of the solution. In this paper a new principle of construction for such schemes is presented which is easy to apply and in most cases gives much better results than the former principlcs. New bounds on relevant parameters of k out of n schemes are developed, too. Furthermore, an extension of the basic problem is introduced a.nd solved in which every combination of the transparencies can contain independent information.