Visual cryptography for general access structures
Information and Computation
New Colored Visual Secret Sharing Schemes
Designs, Codes and Cryptography
Extended capabilities for visual cryptography
Theoretical Computer Science
ASIACRYPT '96 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
New visual secret sharing schemes using probabilistic method
Pattern Recognition Letters
Probabilistic Visual Cryptography Schemes
The Computer Journal
Efficient visual secret sharing scheme for color images
Pattern Recognition
HotSec'09 Proceedings of the 4th USENIX conference on Hot topics in security
Plane transform visual cryptography
IWDW'10 Proceedings of the 9th international conference on Digital watermarking
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
Natural language letter based visual cryptography scheme
Journal of Visual Communication and Image Representation
Threshold visual secret sharing by random grids with improved contrast
Journal of Systems and Software
Region-in-Region incrementing visual cryptography scheme
IWDW'12 Proceedings of the 11th international conference on Digital Forensics and Watermaking
A secret enriched visual cryptography
IWDW'12 Proceedings of the 11th international conference on Digital Forensics and Watermaking
Aspect ratio invariant visual cryptography by image filtering and resizing
Personal and Ubiquitous Computing
Hi-index | 0.00 |
Pixel expansion is an important parameter for Visual Cryptography Schemes (VCS). However, most papers in the literature are dedicated to reduce pixel expansion on the pixel level, i.e. to reduce the number of subpixels that represent a pixel in the original secret image. It is quite insufficient since the final size of the transparencies of the VCS is affected not only by the number of the subpixels, but also by the size of the subpixels in the transparencies. However, reducing the size of the subpixels in the transparencies results in difficulties of alignment of the transparencies. In this paper, we consider the alignment problem in VCS, and prove that in order to visually recover the original secret image, it is not necessary to align the transparencies precisely. This study is restricted to the case when only one transparency is shifted.