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.
Highlights
Visual cryptography scheme (VCS) proposed by Naor and Shamir [1] encodes a binary secret image into multiple share images and distribute shadows to the corresponding participants
XOR-BASED VISUAL CRYPTOGRAPHY SCHEMES In Definition 1, the operation used in contrast condition is Boolean OR
We show the experimental result for sharing one secret image and two secret images using OR and XOR decoding operations
Summary
Visual cryptography scheme (VCS) proposed by Naor and Shamir [1] encodes a binary secret image into multiple share images ( called shadows) and distribute shadows to the corresponding participants. For (k, n) threshold VCS, a secret image is first shared into n shadows. By XOR operation, the contrast of the proposed scheme is 2/3 and 1 when sharing one and two secret images, respectively. B. XOR-BASED VISUAL CRYPTOGRAPHY SCHEMES In Definition 1, the operation used in contrast condition is Boolean OR. A pair of share matrices are generated by the basis matrix of (2, 2)-VCS. Uses basis matrices Bγ0 and Bγ1 to share the secret image again, and generate another 3 sub-shadows as region 2 in the corresponding shadows. Note that only one column of basis matrix is randomly chosen to generate sub-shadows when sharing one secret pixel. The secret image can be decoded on a specific region when performing XOR operation on any two shadows. To process two pixels at one time, we need to construct basis matrices according to the different values of two pixels
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
