Abstract
A deterministic (k, n)*-Visual cryptographic scheme (VCS) was proposed by Arumugam et.al [1] in 2012. Probabilistic schemes are used in visual cryptography to reduce the pixel expansion. In this paper, we have shown that the contrast of probabilistic (k, n)*-VCS is same as that of deterministic (k, n)*- VCS. This paper also proposes a construction of (k, n)*-VCS with multiple essential participants. It is shown that in both deterministic and probabilistic cases the contrast of the (k, n)*-VCS with multiple essential participant is same as that of (k, n)*-VCS.
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.
