Secret Sharing Based Visual Cryptography Scheme Using CMY Color Space

In the era of internet, internet is widely used by the individual for the communication and the information give and take process. Protecting our data from the unconstitutional processes and keeping the secret information secure and in safe hands, every individual utilizes the cryptography such as symmetric or asymmetric. But, these cryptographic processes needs much more cost for the execution. For that reason, lots of secret sharing schemes were proposed. Secret image distribution is the fine talent and skill concern with the protection of important color images by dividing the secret in multiple copies. The basic fundamental behind the scheme is to change the color image into some multiple unreadable format type shares so that they can not reveal the information inside the image until it is again combines with some mathematical computation. A Secret Sharing Scheme can be estimated by it's the four conditions which are Security, Reconstruction Precision, Computation Complexity, Storage Requirement. In Most of the previous scheme there were issues related with security of image for the reconstruction means user can reveal secret from the hidden image, reconstructed of image quality i.e. contrast or accuracy; it means the reconstructed images were distress from the loss of info related to images and resultant image is different from the original image. Images also suffered from pixel expansion issues for which data loss was occurring. In the present work CMY color model will be implemented with ((n-1), n) secret sharing scheme based on visual cryptography for the color image and compared and proved to be better that the RGB color model which is free from the issue of security, pixel expansion and accuracy issue as well. As the printer use the Cyan, Magenta, Yellow and Black color for printing that's why CMY color model is implemented in this work to prove that CMY color space is better than RGB color space.