Preventing Cheating in Computational Visual Cryptography
Fundamenta Informaticae
A comprehensive study of visual cryptography
Transactions on data hiding and multimedia security V
Near-optimal time function for secure dynamic visual cryptography
ISVC'11 Proceedings of the 7th international conference on Advances in visual computing - Volume Part II
Random grid-based visual secret sharing for general access structures with cheat-preventing ability
Journal of Systems and Software
Improvements of a two-in-one image secret sharing scheme based on gray mixing model
Journal of Visual Communication and Image Representation
On the equivalence of two definitions of visual cryptography scheme
ISPEC'12 Proceedings of the 8th international conference on Information Security Practice and Experience
Preventing Cheating in Computational Visual Cryptography
Fundamenta Informaticae
Authenticating visual cryptography shares using 2d barcodes
IWDW'11 Proceedings of the 10th international conference on Digital-Forensics and Watermarking
(Student contribution) ASPS: an authentication scheme using pre-formed visual cryptographic shares
Proceedings of the Fifth International Conference on Security of Information and Networks
A new authentication based cheating prevention scheme in Naor-Shamir's visual cryptography
Journal of Visual Communication and Image Representation
Threshold visual secret sharing by random grids with improved contrast
Journal of Systems and Software
Visual secret sharing with cheating prevention revisited
Digital Signal Processing
Improved tagged visual cryptography by random grids
Signal Processing
| Hi-index | 0.01 |
Visual cryptography (VC) is a method of encrypting a secret image into shares such that stacking a sufficient number of shares reveals the secret image. Shares are usually presented in transparencies. Each participant holds a transparency. Most of the previous research work on VC focuses on improving two parameters: pixel expansion and contrast. In this paper, we studied the cheating problem in VC and extended VC. We considered the attacks of malicious adversaries who may deviate from the scheme in any way. We presented three cheating methods and applied them on attacking existent VC or extended VC schemes. We improved one cheat-preventing scheme. We proposed a generic method that converts a VCS to another VCS that has the property of cheating prevention. The overhead of the conversion is near optimal in both contrast degression and pixel expansion