Abstract
Existing block-based progressive visual cryptography schemes (BPVCS) that prevent cheating are limited to (2,n) and (k,n) thresholds. They are unsuitable for implementing complex sharing techniques in the actual world. A cheating immune BPVCS for general access structure (GAS) is proposed in this paper. To find the parameters that make up the proposed scheme, a simplified multiple assignment procedure based on integer linear programming is introduced. The secret parts can be decrypted by the members of a qualified set. Participants in a forbidden set, on the other hand, are not allowed to know about the secret. The proposed scheme includes cheat-prevention and progressive recovery capabilities. In addition, to generate meaningful shadows for BPVCS, a modified extended VCS (EVCS) is proposed. Our modified EVCS can solve the cover-interference problem in conventional BPVCS. The effectiveness and benefits of the proposed BPVCS are supported through the experimental findings and comparisons.
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.
