Two secret sharing schemes based on Boolean operations
Pattern Recognition
Colored visual cryptography scheme based on additive color mixing
Pattern Recognition
Probabilistic (n, n) Visual Secret Sharing Scheme for Grayscale Images
Information Security and Cryptology
The alignment problem of visual cryptography schemes
Designs, Codes and Cryptography
Visual secret sharing by random grids revisited
Pattern Recognition
Sharing a verifiable secret image using two shadows
Pattern Recognition
A Secret Sharing Scheme for Digital Images Based on Cellular Automata and Boolean Functions
IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part I: Bio-Inspired Systems: Computational and Ambient Intelligence
Self-verifying visual secret sharing using error diffusion and interpolation techniques
IEEE Transactions on Information Forensics and Security - Special issue on electronic voting
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
Image secret sharing method with two-decoding-options: Lossless recovery and previewing capability
Image and Vision Computing
On converting secret sharing scheme to visual secret sharing scheme
EURASIP Journal on Advances in Signal Processing - Special issue on advanced image processing for defense and security applications
Probabilistic visual secret sharing schemes for grey-scale images and color images
Information Sciences: an International Journal
Using colors to improve visual cryptography for black and white images
ICITS'11 Proceedings of the 5th international conference on Information theoretic security
ICIAR'06 Proceedings of the Third international conference on Image Analysis and Recognition - Volume Part I
Improving the visual quality of size invariant visual cryptography scheme
Journal of Visual Communication and Image Representation
Optimal (2,n) and (2,infinity) visual secret sharing by generalized random grids
Journal of Visual Communication and Image Representation
Flexible visual cryptography scheme without distortion
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
Image sharing method for gray-level images
Journal of Systems and Software
Enhancing the perceived visual quality of a size invariant visual cryptography scheme
ICICS'12 Proceedings of the 14th international conference on Information and Communications Security
Natural language letter based visual cryptography scheme
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
Region-in-Region incrementing visual cryptography scheme
IWDW'12 Proceedings of the 11th international conference on Digital Forensics and Watermaking
Color visual cryptography schemes for black and white secret images
Theoretical Computer Science
Aspect ratio invariant visual cryptography by image filtering and resizing
Personal and Ubiquitous Computing
Improved tagged visual cryptography by random grids
Signal Processing
| Hi-index | 0.00 |
Visual cryptography schemes allow the encoding of a secret image, consisting of black or white pixels, into n shares which are distributed to the participants. The shares are such that only qualified subsets of participants can 'visually' recover the secret image. The secret pixels are shared with techniques that subdivide each secret pixel into a certain number m, m ≥ 2 of subpixels. Such a parameter m is called pixel expansion. Recently Yang introduced a probabilistic model. In such a model the pixel expansion m is 1, that is, there is no pixel expansion. The reconstruction of the image however is probabilistic, meaning that a secret pixel will be correctly reconstructed only with a certain probability. In this paper we propose a generalization of the model proposed by Yang. In our model we fix the pixel expansion m ≥ 1 that can be tolerated and we consider probabilistic schemes attaining such a pixel expansion. For m = 1 our model reduces to the one of Yang. For big enough values of m, for which a deterministic scheme exists, our model reduces to the classical deterministic model. We show that between these two extremes one can trade the probability factor of the scheme with the pixel expansion. Moreover, we prove that there is a one-to-one mapping between deterministic schemes and probabilistic schemes with no pixel expansion, where contrast is traded for the probability factor.