Abstract
In conventional visual secret sharing (VSS), a secret image is encrypted into noise-like random-looking shares, a subset of which when stacked together reveal the secret. Random grids (RG) eliminate pixel expansion and extensive codebook designs of conventional VSS. However, like conventional VSS, RG-based VSS are prone to collusion attacks. Existing cheat-prevention algorithms reduce the probability of collusion attacks, but these do not consider issues arising due to noise-like nature of the shares. We introduce two issues that may lead to false accusations and we devise a robust cheat-prevention algorithm to tackle these. Experimental results validate the efficacy of the algorithm.
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.
