Abstract

A ( t , n ) visual cryptography scheme (VCS) encodes a secret image into n shadow images (shadows) distributed among n participants. When any qualified set of at least t participants stack their shadows, the secret image can be visually revealed. The first VCS proposed by Naor and Shamir was only designed for encrypting a black-and-white secret image; subsequently, some colored VCSs (CVCSs) for sharing colored images were proposed to enhance the applicability. In CVCSs, we usually use several color subpixels to represent a secret pixel where the number of subpixels is referred to as the pixel expansion. Generally, the CVCS requires a larger pixel expansion to produce more colors; however, this expansion will increase the shadow size. We therefore study the additive color mixing in a probabilistic way and propose a new CVCS whose pixel expansion is fixed and improves on the previous CVCSs, at the price of reducing the contrast quality to certain level.

Full Text
Paper version not known

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 call

Disclaimer: 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.