Melola Discovery

← Melola Discovery

Jurnal SINTA 2

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

Journal of ICT Research and Applications (JICTRA) · Vol. 12 No. 1 (2018) · pp. 87–102

DOI
10.5614/itbj.ict.res.appl.2018.12.1.6
ISSN
2338-5499, 2337-5787
Published
2018-04-30
Publisher
DRI - ITB
Language
eng

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

Collaboration network of the authors

7 authors · 6 co-authorship links · 1 across different organisations

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • Telkom University
  • Universitas PGRI Kalimantan
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Hasmawati HasmawatiTelkom University1
Prasti Eko YunantoTelkom University1
Farah AfiantiTelkom University1
Ali MuhammadUniversitas PGRI Kalimantan1
Soni YoraTelkom University1

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

Metadata source: OAI-PMH (metadata jurnal) https://journals.itb.ac.id/index.php/jictra/oai, first harvested 26 Okt 2026, last seen 26 Okt 2026.
Original metadata (oai_dc) 
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Overcoming Alignment Problem in Non-Identical Mathematical Support Visual Cryptography Schemes</dc:title>
	<dc:creator>Barmawi, Ari Moesriami</dc:creator>
	<dc:creator>Bramantya, Widhian</dc:creator>
	<dc:subject xml:lang="en-US">alignment problem</dc:subject>
	<dc:subject xml:lang="en-US">decoding</dc:subject>
	<dc:subject xml:lang="en-US">encoding</dc:subject>
	<dc:subject xml:lang="en-US">orthogonal points</dc:subject>
	<dc:subject xml:lang="en-US">non-identical mathematical support</dc:subject>
	<dc:subject xml:lang="en-US">visual cryptography.</dc:subject>
	<dc:description xml:lang="en-US">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 &amp;lt; A. The security is maintained, since an attacker cannot obtain any information related to the secret image.</dc:description>
	<dc:publisher xml:lang="en-US">DRI - ITB</dc:publisher>
	<dc:date>2018-04-30</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://journals.itb.ac.id/index.php/jictra/article/view/3778</dc:identifier>
	<dc:identifier>10.5614/itbj.ict.res.appl.2018.12.1.6</dc:identifier>
	<dc:source xml:lang="en-US">Journal of ICT Research and Applications; Vol. 12 No. 1 (2018); 87-102</dc:source>
	<dc:source>2338-5499</dc:source>
	<dc:source>2337-5787</dc:source>
	<dc:source>10.5614/itbj.ict.res.appl.2018.12.1</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://journals.itb.ac.id/index.php/jictra/article/view/3778/3255</dc:relation>
</oai_dc:dc>