Abstract
Recently, Lin et al. [29] introduced a (k, n) multi-factor cheating prevention visual cryptographic scheme (MCPVCS) by hiding verification images into shadow images. Through authenticating the verification image and the reconstructed image simultaneously, Lin et al.’s MCPVCS can prevent cheating attack that dishonest participants may collude and cheat the honest one to get a wrong secret image. However, the large n reduces the size of verification image and makes the verification difficult. In this paper, a (k, n)-MCPVCS with the large size of verification image is proposed. There are three main contributions for the proposed (k, n)-MCPVCS: (i) the verification condition in (k, n)-MCPVCS is redefined, (ii) a new minimum (k, n)-connected graph problem is introduced, on which the minimum number of verification images is determined, and (iii) the proposed (k, n)-MCPVCS with the large size of verification image can more easily authenticate the unambiguity of verification image.
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 callMore From: Journal of Visual Communication and Image Representation
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.
