scispace - formally typeset
Journal ArticleDOI

Design of visual cryptographic methods with smoothlooking decoded images of invariant size for grey-level images

S-F Tua, +1 more
- 01 Jun 2007 - 
- Vol. 55, Iss: 2, pp 90-101
Reads0
Chats0
TLDR
Two visual cryptographic methods are proposed to solve the problem of pixel expansion and to improve the visual effect of the stacked image at the same time and can satisfy the security and contrast conditions required by the VSS scheme.
Abstract
Most visual secret sharing (VSS) schemes need to encrypt a pixel of the secret image into m subpixels on the share; obviously, the shares are enlarged and so are the stacked images. A handful of studies try to solve the problem of pixel expansion, but little information is available on improving the visual effect of the stacked image. In addition, most of them do not mention how to deal with grey-level images. Since the secret is decoded by the human eye, the visual effect of the stacked image is an important issue in the study of the VSS scheme. This paper proposes two visual cryptographic methods to solve the problem of pixel expansion and to improve the visual effect of the stacked image at the same time. Unlike in previous studies, multiple pixels are simultaneously encoded each time. With the help of halftoning, the methods can be applied to encoding grey-level images. The experimental results show that these methods have a better visual effect on the stacked image compared with other researc...

read more

Citations
More filters
Journal ArticleDOI

Progressive Visual Cryptography With Unexpanded Shares

TL;DR: No one can obtain any hidden information from a single share, hence ensures the security, and a brand new sharing scheme of progressive VC to produce pixel-unexpanded shares is proposed.
Journal ArticleDOI

Block-based progressive visual secret sharing

TL;DR: A non-expanded block-based progressive visual secret sharing scheme with noise-like and meaningful shares with several advantages over other related methods, including one that is more suitable for grayscale and color secret images.
Journal ArticleDOI

Random-Grid-Based Visual Cryptography Schemes

TL;DR: A random-grid-based nonexpanded visual cryptography scheme for generating both meaningful and noise-like shares is discussed, and a probability allocation method is proposed that is capable of producing the best contrast in both the share images and the stack image.
Journal ArticleDOI

Improving the Visual Quality of Size-Invariant Visual Cryptography for Grayscale Images: An Analysis-by-Synthesis (AbS) Approach

TL;DR: This work proposes an analysis-by-synthesis (AbS) framework to integrate the halftoning process and the VC encoding: the secret pixel/block is reconstructed from the shares in the encoder and the error between the reconstructed secret and the original secret images is fed back and compensated concurrently by the error diffusion process.
Journal Article

Sensitive Digital Image Watermarking for Copyright Protection

TL;DR: The simulation results reveal that the proposed watermark hiding scheme has good robustness to a range of image processing attacks and aims at improving the security of the related schemes.
References
More filters
Book

Cryptography: Theory and Practice

TL;DR: The object of the book is to produce a general, comprehensive textbook that treats all the essential core areas of cryptography.

Visual Cryptography

Moni Naor, +1 more
TL;DR: In this paper, a new type of cryptographic scheme, which can decode concealed images without any cryptographic computations, is proposed, which is called k-out-of-n secret sharing.
Journal ArticleDOI

Visual Cryptography for General Access Structures

TL;DR: This paper examines graph-based access structures, i.e., access structures in which any qualified set of participants contains at least an edge of a given graph whose vertices represent the participants of the scheme, and provides a novel technique for realizing threshold visual cryptography schemes.
Journal ArticleDOI

Halftone visual cryptography

TL;DR: The proposed method utilizes the void and cluster algorithm to encode a secret binary image into n halftone shares (images) carrying significant visual information, and shows that the visual quality of the obtained halftones are observably better than that attained by any available visual cryptography method known to date.
Journal ArticleDOI

Visual cryptography for gray-level images by dithering techniques

TL;DR: A (k, n)-threshold visual cryptography scheme is proposed to encode a secret image into n shadow images, where any k or more of them can visually recover the secret image, but any k - 1 or fewer of them gain no information about it.