Visual cryptography for general access structures
Information and Computation
Communications of the ACM
Visual cryptography for gray-level images by dithering techniques
Pattern Recognition Letters
Optimal colored threshold visual cryptography schemes
Designs, Codes and Cryptography
Sharing multiple secrets in visual cryptography
Pattern Recognition
Colored visual cryptography scheme based on additive color mixing
Pattern Recognition
Visual secret sharing for multiple secrets
Pattern Recognition
Visual Cryptography Schemes with Reversing
The Computer Journal
On the security of a visual cryptography scheme for color images
Pattern Recognition
Sharing visual multi-secrets using circle shares
Computer Standards & Interfaces
Step construction of visual cryptography schemes
IEEE Transactions on Information Forensics and Security
An optimization model for visual cryptography schemes with unexpanded shares
ISMIS'06 Proceedings of the 16th international conference on Foundations of Intelligent Systems
Optimum Pixel Expansions for Threshold Visual Secret Sharing Schemes
IEEE Transactions on Information Forensics and Security - Part 2
| Hi-index | 0.00 |
With visual cryptography in mind, the security property of a new scheme is always one of main concerns. However, the ideal security is not taken into account in some visual cryptography schemes sharing multiple secrets. In this paper, the security of a multi-secret visual cryptography scheme proposed by Feng et al. is analyzed. We show that the security of their scheme is not ideal. Precisely, it is insecure since some information of the secret images can be inferred by block attacking the second share alone. The main weak design is proved and shown by means of giving theoretical analysis and conducting some counter experiments.