Multiple Watermarking in Visual Cryptography
IWDW '07 Proceedings of the 6th International Workshop on Digital Watermarking
Halftone visual cryptography via error diffusion
IEEE Transactions on Information Forensics and Security
Friendly Color Visual Secret Sharing by Random Grids
Fundamenta Informaticae
A comprehensive study of visual cryptography
Transactions on data hiding and multimedia security V
Secure masks for visual cryptography
Transactions on data hiding and multimedia security V
Plane transform visual cryptography
IWDW'10 Proceedings of the 9th international conference on Digital watermarking
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
Visual Multiple-Secret Sharing by Circle Random Grids
SIAM Journal on Imaging Sciences
Yet another multiple-image encryption by rotating random grids
Signal Processing
On the equivalence of two definitions of visual cryptography scheme
ISPEC'12 Proceedings of the 8th international conference on Information Security Practice and Experience
Image hatching for visual cryptography
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP) - Special Issue on Multimedia Security
Improving the visual quality of random grid-based visual secret sharing
Signal Processing
Quality-adaptive visual secret sharing by random grids
Journal of Systems and Software
XOR-based meaningful visual secret sharing by generalized random grids
Proceedings of the first ACM workshop on Information hiding and multimedia security
Improved tagged visual cryptography by random grids
Signal Processing
| Hi-index | 0.01 |
Visual cryptography encodes a secret binary image (SI) into n shares of random binary patterns. If the shares are xeroxed onto transparencies, the secret image can be visually decoded by superimposing a qualified subset of transparencies, but no secret information can be obtained from the superposition of a forbidden subset. The binary patterns of the n shares, however, have no visual meaning and hinder the objectives of visual cryptography. Extended visual cryptography was proposed recently to construct meaningful binary images as shares using hypergraph colourings, but the visual quality is poor. In this paper, a novel technique named halftone visual cryptography is proposed to achieve visual cryptography via halftoning. Based on the blue-noise dithering principles, the proposed method utilizes the void and cluster algorithm to encode a secret binary image into n halftone shares (images) carrying significant visual information. The simulation shows that the visual quality of the obtained halftone shares are observably better than that attained by any available visual cryptography method known to date.