Abstract
An important problem in visual cryptography is the alignment problem. Although Liu, et al. have proposed a method for aligning the shares, there is still a problem with the non-identical mathematical support visual cryptography schemes. For overcoming this problem, the Three-Orthogonal-Point (3OP) method is proposed in this paper. Based on the experimental result it was proven that it can overcome the alignment problem, while the time complexity for aligning the shares is decreased significantly from O((m×A) 2 ) to O(m×AI) , for AI < A. The security is maintained, since an attacker cannot obtain any information related to the secret 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 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.
