On the equivalence of two definitions of visual cryptography scheme

Authors:
Teng Guo;Feng Liu;ChuanKun Wu
Affiliations:
State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China and Graduate University of Chinese Academy of Sciences, Beijing, Chi ...;State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China;State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China
Venue:
ISPEC'12 Proceedings of the 8th international conference on Information Security Practice and Experience
Year:
2012

Citing 24
Cited 2

Visual cryptography for general access structures

Information and Computation
Contrast-optimal k out of n secret sharing schemes in visual cryptography

Theoretical Computer Science - computing and combinatorics
A New Approach for Visual Cryptography

Designs, Codes and Cryptography
Contrast Optimal Threshold Visual Cryptography Schemes

SIAM Journal on Discrete Mathematics
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
Cheating in Visual Cryptography

Designs, Codes and Cryptography
Optimal (2, n) visual cryptographic schemes

Designs, Codes and Cryptography
Reduce shadow size in aspect ratio invariant visual secret sharing schemes using a square block-wise operation

Pattern Recognition
Colored visual cryptography without color darkening

Theoretical Computer Science
Visual cryptography schemes with optimal pixel expansion

Theoretical Computer Science
A cheating prevention scheme for binary visual cryptography with homogeneous secret images

Pattern Recognition
Colored visual cryptography scheme based on additive color mixing

Pattern Recognition
The alignment problem of visual cryptography schemes

Designs, Codes and Cryptography
Halftone visual cryptography via error diffusion

IEEE Transactions on Information Forensics and Security
Optimal (k, n) visual cryptographic schemes for general k

Designs, Codes and Cryptography
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
An optimization model for visual cryptography schemes with unexpanded shares

ISMIS'06 Proceedings of the 16th international conference on Foundations of Intelligent Systems
Cheating immune (2, n)-threshold visual secret sharing

SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks
Halftone visual cryptography

IEEE Transactions on Image Processing
Cheating Prevention in Visual Cryptography

IEEE Transactions on Image Processing

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

A visual cryptography scheme (VCS) is a secret sharing method, for which the secret can be decoded by human eyes without needing any cryptography knowledge nor any computation. To the best of our knowledge, there are two different definitions of basis matrix (k,n)-VCS. The definition of unconditional secure basis matrix (k,n)-VCS is the generally accepted one, and has been widely used since the pioneer work of Naor and Shamir in 1994, while the definition of stacking secure basis matrix (k,n)-VCS is relatively new, and has been used in many studies in recent years. Our study shows that the above two definitions are actually equivalent. Furthermore, we generalize the equivalence relation to general access structure basis matrix VCS and general access structure size invariant VCS. But the equivalence relation does not hold for non-basis matrix (k,n)-VCS.