Skip to content
naulon

Not checkedNot checked for notices yet.

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

Ari Moesriami Barmawi, Widhian Bramantya

Journal of ICT Research and Applications · 2018

doi:10.5614/itbj.ict.res.appl.2018.12.1.6 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

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.

Abstract licence: CC BY-ND

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.