Visual cryptography for general access structures
Information and Computation
Extended capabilities for visual cryptography
Theoretical Computer Science
New Results on Visual Cryptography
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
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
Determining the Optimal Contrast for Secret Sharing Schemes in Visual Cryptography
Combinatorics, Probability and Computing
New visual secret sharing schemes using probabilistic method
Pattern Recognition Letters
Aspect ratio invariant visual secret sharing schemes with minimum pixel expansion
Pattern Recognition Letters
Optimal colored threshold visual cryptography schemes
Designs, Codes and Cryptography
Probabilistic Visual Cryptography Schemes
The Computer Journal
Size-Adjustable Visual Secret Sharing Schemes
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
New Size-Reduced Visual Secret Sharing Schemes with Half Reduction of Shadow Size
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
The alignment problem of visual cryptography schemes
Designs, Codes and Cryptography
Optimal (k, n) visual cryptographic schemes for general k
Designs, Codes and Cryptography
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
Visual Cryptography and Secret Image Sharing (Digital Imaging and Computer Vision)
Visual Cryptography and Secret Image Sharing (Digital Imaging and Computer Vision)
Embedded Extended Visual Cryptography Schemes
IEEE Transactions on Information Forensics and Security
Hi-index | 0.00 |
For visual cryptography scheme (VCS), normally, the size of the recovered secret image will be expanded by m(≥1) times of the original secret image. In most cases, m is not a square number, hence the recovered secret image will be distorted. Sometimes, m is too large that will bring much inconvenience to the participants to carry the share images. In this paper, we propose a visual cryptography scheme which simulated the principle of fountains. The proposed scheme has two advantages: non-distortion and flexible (with respect to the pixel expansion). Furthermore, the proposed scheme can be applied to any VCS that is under the pixel by pixel encryption model, such as VCS for general access structure, color VCS and extended VCS, and our VCS does not restrict to any specific underlying operation. Compared with other non-distortion schemes, the proposed scheme is more general and simpler, real flexible and has competitive visual quality for the recovered secret image.