Aspect ratio invariant visual secret sharing schemes with minimum pixel expansion

Authors:
Ching-Nung Yang;Tse-Shih Chen
Affiliations:
Department of Computer Science and Information Engineering, National Dong Hwa University, #1, Da Hsueh Rd, Sec. 2, Shou-Feng, Hualien, Taiwan, ROC;Department of Computer Science and Information Engineering, National Dong Hwa University, #1, Da Hsueh Rd, Sec. 2, Shou-Feng, Hualien, Taiwan, ROC
Venue:
Pattern Recognition Letters
Year:
2005

Citing 7
Cited 16

Visual cryptography for general access structures

Information and Computation
Constructions and Properties of k out of nVisual Secret Sharing Schemes

Designs, Codes and Cryptography
Contrast-optimal k out of n secret sharing schemes in visual cryptography

Theoretical Computer Science - computing and combinatorics
Threshold Visual Cryptography Schemes with Specified Whiteness Levels of Reconstructed Pixels

Designs, Codes and Cryptography
A New Approach for Visual Cryptography

Designs, Codes and Cryptography
New Results on Visual Cryptography

CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
New visual secret sharing schemes using probabilistic method

Pattern Recognition Letters

Reduce shadow size in aspect ratio invariant visual secret sharing schemes using a square block-wise operation

Pattern Recognition
A novel secret image sharing scheme in color images using small shadow images

Information Sciences: an International Journal
A visual cryptography based system for sharing multiple secret images

ISCGAV'07 Proceedings of the 7th WSEAS International Conference on Signal Processing, Computational Geometry & Artificial Vision
Sharing secrets in stego images with authentication

Pattern Recognition
Visual secret sharing by random grids revisited

Pattern Recognition
Secret image sharing based on cellular automata and steganography

Pattern Recognition
Dot-Size Variant Visual Cryptography

IWDW '09 Proceedings of the 8th International Workshop on Digital Watermarking
Efficient multi-secret image sharing based on Boolean operations

Signal Processing
Flip visual cryptography (FVC) with perfect security, conditionally-optimal contrast, and no expansion

Journal of Visual Communication and Image Representation
A comprehensive study of visual cryptography

Transactions on data hiding and multimedia security V
A new approach to camera image indexing

CAIP'05 Proceedings of the 11th international conference on Computer Analysis of Images and Patterns
New aspect ratio invariant visual secret sharing schemes using square block-wise operation

ICIAR'05 Proceedings of the Second international conference on Image Analysis and Recognition
A cost-effective private-key cryptosystem for color image encryption

ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part I
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
Aspect ratio invariant visual cryptography by image filtering and resizing

Personal and Ubiquitous Computing

Quantified Score

Hi-index	0.10

Visualization

Abstract

Visual secret sharing (VSS) scheme is a perfect secure method to hide a secret image by breaking it into shadow images and one can decode it easily by the human visual system. We use m, the pixel expansion, subpixels to represent a pixel. Suppose the secret image is a circle and m is not a square value, i.e., the aspect ratio is changed. After performing the VSS technique, the circle will be changed to an ellipse and consequently lead to the loss of information. To avoid distorting the image, the dummy subpixels are added to keep the aspect ratio unchanged. In this paper, we propose a novel method to dramatically reduce the number of extra subpixels to construct the aspect ratio invariant VSS schemes.