Overcoming Alignment Problem in Non-Identical Mathematical Support Visual Cryptography Schemes

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.

Keywords

• alignment problem
• decoding
• encoding
• orthogonal points
• non-identical mathematical support
• visual cryptography.