A Construction Method of (2, 3) Visual Cryptography Scheme
TLDR
Theoretic analysis and experimental results demonstrate the feasibility and advantages of the proposed (2, 3)-VCS, which can share one or two secret images into 3 shadows, stacking any two shadows will reveal the secret image.Abstract:
Visual cryptography scheme (VCS) shares a binary secret image into multiple shadows, stacking qualified set of shadows will decode the secret image without computer resources. In this paper, we propose a (2, 3)-VCS, which can share one or two secret images into 3 shadows, stacking any two shadows will reveal the secret image. The shadow size is 3/2 times of the secret image. The contrasts of the revealed image are 1/3 and 1/2 when we share one and two secret images, respectively. We can also reveal the secret image by XOR decoding operation, and the visual quality of the revealed image can be further improved. By XOR decoding operation, the contrasts of the revealed image will be 2/3 and 1 when we share one or two secret images, respectively. In the case of sharing two secret images, the revealed two secret images have no distortion. Theoretic analysis and experimental results demonstrate the feasibility and advantages of the proposed (2, 3)-VCS.read more
Citations
More filters
Journal ArticleDOI
(t, k, n) XOR-based visual cryptography scheme with essential shadows
Peng Li,Jianfeng Ma,Quan Ma +2 more
TL;DR: A construction method for (t, k, n)-XVCS with essential shadows is proposed and the secret image can be revealed perfectly, and the shadow size is small compared with VCS.
Journal ArticleDOI
An overview of visual cryptography techniques
TL;DR: Over 40 visual cryptography schemes that have been proposed in the past two decades were analyzed and compared and indicate that existing problems such as pixel expansion, poor quality of recovered image quality, computational and memory complexities still exist and a optimizing the trade-off between these requirements still requires further investigation.
Posted Content
Embedded Extended Visual Cryptography Schemes.
Feng Liu,Chuankun Wu +1 more
TL;DR: This paper proposes a construction of EVCS which is realized by embedding random shares into meaningful covering shares, and it is called the embedded EVCS, and has competitive visual quality compared with many of the well-known EVCSs in the literature.
Journal ArticleDOI
Cheating immune k-out-of-n block-based progressive visual cryptography
TL;DR: Theoretical analysis demonstrates that the proposed (k, n)-BPVCS is not only cheating immune, but also suitable for general k-out-of-n threshold, where k and n are integers with 2 ≦ k ≤ n.
Journal ArticleDOI
Threshold Visual Cryptography Schemes With Tagged Shares
Pei-Ling Chiu,Kai-Hui Lee +1 more
TL;DR: This study theoretically analyzes the performances of the proposed TVCS approach, and demonstrates implementation of the approach, to provide better visual quality of recovered images by improving on previous methods.
References
More filters
Journal ArticleDOI
Visual cryptography for color images
TL;DR: Three methods for visual cryptography of gray-level and color images based on past studies in black-and-white visual cryptography, the halftone technology, and the color decomposition method are proposed.
Journal ArticleDOI
New visual secret sharing schemes using probabilistic method
TL;DR: The frequency of white pixels is used to show the contrast of the recovered image and the scheme is nonexpansible and can be easily implemented on a basis of conventional VSS scheme.
Journal ArticleDOI
Two secret sharing schemes based on Boolean operations
TL;DR: A probabilistic (2,n) scheme for binary images and a deterministic (n,n), which provides a better contrast and significantly smaller recognized areas than other methods and gives an exact reconstruction.
Journal ArticleDOI
Sharing multiple secrets in visual cryptography
TL;DR: This paper proposes a visual secret sharing scheme that encodes a set of x≥2 secrets into two circle shares such that none of any single share leaks the secrets and the x secrets can be obtained one by one by stacking the first share and the rotated second shares with x different rotation angles.
Journal ArticleDOI
Probabilistic Visual Cryptography Schemes
TL;DR: This paper proposes a generalization of the model proposed by Yang, and proves that there is a one-to-one mapping between deterministic schemes and probabilistic schemes with no pixel expansion, where contrast is traded for the probability factor.
Related Papers (5)
A novel two-in-one image secret sharing scheme based on perfect black visual cryptography
Image secret sharing method with two-decoding-options: Lossless recovery and previewing capability
Ching-Nung Yang,Chuei-Bang Ciou +1 more