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
Foundations of Cryptography: Basic Tools
Foundations of Cryptography: Basic Tools
Contrast-Optimal k out of n Secret Sharing Schemes in Visual Cryptography
COCOON '97 Proceedings of the Third Annual International Conference on Computing and Combinatorics
Determining the Optimal Contrast for Secret Sharing Schemes in Visual Cryptography
Combinatorics, Probability and Computing
A multiple-level visual secret-sharing scheme without image size expansion
Information Sciences: an International Journal
An extended multi-secret images sharing scheme based on boolean operation
ICT-EurAsia'13 Proceedings of the 2013 international conference on Information and Communication Technology
Threshold visual secret sharing by random grids with improved contrast
Journal of Systems and Software
Hi-index | 0.00 |
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. In their pioneer work, Naor and Shamir mentioned that encrypting a block of pixels simultaneously may result in better result. Inspired by that idea, we first define multi-pixel encryption visual cryptography scheme (ME-VCS), which encrypts a block of t (1≤t) pixels at a time. Then we give an upper bound of the overall contrast of ME-VCS. We also give a lower bound of the pixel expansion of (n,n,t)-ME-VCS. At last, we built a contrast-optimal ME-VCS from a contrast-optimal VCS and built an optimal (n,n,t)-ME-VCS from an optimal (n,n)-VCS.