Indian Journal of Computer Science

Open Access Open Access  Restricted Access Subscription Access

A Multi-Path Based Embedding Scheme at Perfect Maze


Affiliations
1 Lecturer, Department of Computer Science and Engineering at Bangamata Sheikh Fojilatunnesa Mujib Science & Technology University, Jamalpur - 2012, Bangladesh
2 Associate Professor, Department of Computer Science and Engineering at Jatiya Kabi Kazi Nazrul Islam University, Mymensingh - 2220, Bangladesh
3 Professor, Department of Computer Science and Engineering of Jatiya Kabi Kazi Nazrul Islam University, Mymensingh - 2220, Bangladesh

   Subscribe/Renew Journal


Steganography is a process of hiding data in a media, e.g., image, audio, video, etc. There are lots of areas where steganography can be used. Many researchers are devoting their valuable efforts to hide messages before sending them to a destination through maze-based steganography. However, maze-based steganography has the drawback of reducing embedding capacity. Another problem of maze application at embedding is the imperfection of its solution paths. Imperfect paths are not used for embedding by the maze. That is why while selecting multiple paths, the process of Niwayama et al. in 2010 prunes many paths considering their overlapping or crossing affairs with other ones. In this paper, a solution to those stated problems of Niwayama et al. is outlined and successful results found are demonstrated here too. First, an imperfect maze is tried to be changed virtually to a perfect maze. Then solution paths from start to end are generated. While generating solution paths, the longest path among them is considered to cross or join a point along their pathways. Therefore, one path among those imperfect paths is considered embedded at and extraction was not employed by any earlier proposal, so far we know. Contribution to the stated research area will increase the embedding capacity. For measuring the longest path, the tie is broken by comparing x coordinates and then, if required, y coordinates. The illustrated result in the result analysis section details the justification of our claim.

Keywords

Steganography.
User
Subscription Login to verify subscription
Notifications
Font Size

  • D.-C. Lou, N.-I. Wu, C.-M. Wang, Z.-H. Lin, and C.-S. Tsai, “A novel adaptive steganography based on local complexity and human vision sensitivity,” J. Syst. Softw., vol. 83, no. 7, pp. 1236–1248, 2010.

  • K. Bailey and K. Curran, “An evaluation of image based steganography methods,” Int. J. Digit. Evid., vol. 2, no. 2, pp. 1–40, 2003.

  • S. Mutnuru, S. K. Sah, and S. Y. P. Kumar, “Selective encryption of image by number maze technique,” Int. J. Cryptogr. Inf. Syst., vol. 10, no. 2, pp. 1-10, 2020, doi: 10.5121/ijcis.2020.10201

  • E. Guvenoglu, “Maze based image encryption algorithm,” Int. Res. J. Eng. Technol., vol. 2, no. 8, pp. 1578–1585, 2015, doi: 10.31202/ecjse.571030

  • T. T. K. Hue, T. M. Hoang, H. X. Thanh, and A. Braeken, “Bit plane decomposing image encryption based on discrete Cat-Hadamard map,” in 2018 IEEE Seventh Int. Conf. Commun. Electronics (ICCE), 2018, pp. 344–349, doi: 10.1109/CCE.2s018.8465711

  • D. Debanjali, A. Bandopadhyay, S. Jana, A. K. Maji, and R.K Pals, “A novel image steganographic scheme using 8x8 Sudoku puzzle,” in Adv. Comput. Syst. Secur., pp. 85-100. Springer, Singapore, 2017.

  • S. Mahato, D. K. Yadav, and D. A. Khan, “A minesweeper game-based steganography scheme,” J. Inf. Secur. Appl., vol. 32, pp. 1–14, 2017, doi: 10.1016/j.jisa.2016.11.005

  • S. Sharma, A. Gupta, M. C. Trivedi, and V. K. Yadav, “Analysis of different text steganography techniques: A survey,” in 2016 2nd Int. Conf. Comput. Intell. Communication Technol. (CICT), 2016, pp. 130–133, doi: 10.1109/CICT.2016.34

  • Z.-H. Ou and L.-H. Chen, “A steganographic method based on tetris games,” Inf. Sci., vol. 276, pp. 343–353, 2014, doi: 10.1016/j.ins.2013.12.024

  • A. A. Ali and A.-H. S. Saad, “Image steganography technique by using Braille method of blind people (LSBraille),” Int. J. Image Process., vol. 7, no. 1, pp. 81–89, 2013.

  • Hemalatha, S., U. D. Acharya, Renuka, A., and P. R. Kamath, “A secure and high capacity image steganography technique,” arXiv Prepr. arXiv1304.3629v1, 2013.

  • M. R. D. Farahani and A. Pourmohammad, “A DWT based perfect secure and high capacity Image Steganography method,” in 2013 Int. Conf. Parallel Distrib. Comput., Appl. Technol., 2013, pp. 314–317, doi: 10.1109/PDCAT.2013.56

  • T. Sukumar and K. R. Santha, “Maze based data hiding using back tracker algorithm,” Int. J. Eng. Res. Appl., vol. 2, no. 4, pp. 499-504, 2012, doi: 10.1.1.416.3524&rep=rep1&type=pdf

  • R. Ibrahim and T. S. Kuan, “Steganography algorithm to hide secret message inside an image,” arXiv Prepr. arXiv1112.2809v1, 2011.

  • T. Pasquier and J. Erdogan, “Genetic algorithm optimization in maze solving problem,” Inst. Super. d’Electronique Paris, 2016.

  • A. D. Ker, “Steganalysis of embedding in two least-significant bits,” IEEE Trans. Inf. Forensics Secur., vol. 2, no. 1, pp. 46–54, 2007, doi: 10.1109/TIFS.2006.890519

  • G. M. Kamau, “An enhanced least significant bit steganographic method for information hiding,” JKUAT Institutional Repos., 2014.

  • M. M. Amin, M. Salleh, S. Ibrahim, M. R. Katmin, and M. Z. I. Shamsuddin, “Information hiding using steganography,” in 4th Nat. Conf. Telecommunication Technol., 2003. NCTT 2003 Proc., 2003, pp. 21–25, doi: 10.1109/NCTT.2003.1188294 19. D. Artz, “Digital steganography: hiding data within data,” IEEE Internet Comput., vol. 5, no. 3, pp. 75–80, 2001, doi: 10.1109/4236.935180.

  • H.-L. Lee, C.-F. Lee, and L.-H. Chen, “A perfect maze based steganographic method,” J. Syst. Softw., vol. 83, no. 12, pp. 2528–2535, 2010, doi: 10.1016/j.jss.2010.07.054

  • Y.-K. Lee and L.-H. Chen, “High capacity image steganographic model,” IEE Proc. - Vision, Image Signal Process., vol. 147, no. 3, pp. 288–294, 2000, doi: 10.1049/ip-vis:20000341

  • N. Niwayama, N. Chen, T. Ogihara, and Y. Kaneda, “A steganographic method for mazes,” in Proc. of Pacific Rim Workshop Digit. Steganography, 2002.

  • A. H. M. Kamal and M. M. Islam. "Enhancing embedding capacity and stego image quality by employing multi predictors," J. Inform. Secur. Appl., vol. 32, pp. 59–74, 2017, doi: 10.1016/j.jisa.2016.08.005

  • A. H. M. Kamal and M. M. Islam, "Boosting up the data hiding rate through multi cycle embedment process," J. Visual Commun. Image Representation, vol. 40, part B, pp. 574–588, 2016, doi: 10.1016/j.jvcir.2016.07.023

  • A. H. M. Kamal and M. M. Islam, "Enhancing the performance of the data embedment process through encoding errors," Electronics, vol. 5, no. 4, p. 79, 2016, doi: 10.3390/electronics5040079

  • A. H. M. Kamal and M. M. Islam, "Capacity improvement of reversible data hiding scheme through better prediction and double cycle embedding process," in 2015 IEEE Int. Conf. Adv. Netw. Telecommun. Syst. (ANTS), pp. 1–6, doi: 10.1109/ANTS.2015.7413636

  • A. H. M. Kamal and M. M. Islam, "An image distortion-based enhanced embedding scheme," Iran J. Comp. Sci., vol. 1, pp. 175–186, 2018, doi: 10.1007/s42044-018-0016-3

  • A. H. M. Kamal and M. M. Islam, "A prediction error based histogram association and mapping technique for data embedment," J. Inform. Secur. Appl., 48, 2019, 102368.

  • A. H. M. Kamal, M. M. Islam, and Z. Islam, "An embedding technique for smartcard-supported e-healthcare services," Iran J. Comput. Sci., vol. 3, no. 2, 195-205, 2020, doi: 10.1007/s42044-020-00055-1

  • A. H. M. Kamal and M. M. Islam, "Enhancing the embedding payload by handling the affair of association and mapping of block pixels through prediction errors histogram," in 2016 Int. Conf. Netw. Syst. Secur. (NSysS). IEEE, 2016, pp. 1–8, doi: 10.1109/NSysS.2016.7400691

  • A. H. M. Kamal and M. M. Islam, "Facilitating and securing offline e-medicine service through image steganography," Healthcare Technol. Lett., vol. 1, no. 2, pp. 74–79, 2014, doi: 10.1049/htl.2013.0026

  • A. H. M. Kamal, "Steganography: Securing message in wireless network," Int. J. Comput. Technol., vol. 4, no. 3, pp. 797–801, doi: 10.1.1.799.6634

  • S. Habiba, A. H. M. Kamal, and M. M. Islam, "Enhancing the robustness of visual degradation based HAM reversible data hiding," J. Comput. Sci., vol. 12, no. 2, pp. 88–97, 2016, doi: 10.3844/jcssp.2016.88.97

  • A. H. M. Kamal, "Securing the smart card authentications process by embedment random number of data bits into each pixel," Int. J. u-and e-Service, Sci. Technol


Abstract Views: 222

PDF Views: 0




  • A Multi-Path Based Embedding Scheme at Perfect Maze

Abstract Views: 222  |  PDF Views: 0

Authors

Sujit Roy
Lecturer, Department of Computer Science and Engineering at Bangamata Sheikh Fojilatunnesa Mujib Science & Technology University, Jamalpur - 2012, Bangladesh
Subrata Kumar Das
Associate Professor, Department of Computer Science and Engineering at Jatiya Kabi Kazi Nazrul Islam University, Mymensingh - 2220, Bangladesh
A. H. M. Kamal
Professor, Department of Computer Science and Engineering of Jatiya Kabi Kazi Nazrul Islam University, Mymensingh - 2220, Bangladesh

Abstract


Steganography is a process of hiding data in a media, e.g., image, audio, video, etc. There are lots of areas where steganography can be used. Many researchers are devoting their valuable efforts to hide messages before sending them to a destination through maze-based steganography. However, maze-based steganography has the drawback of reducing embedding capacity. Another problem of maze application at embedding is the imperfection of its solution paths. Imperfect paths are not used for embedding by the maze. That is why while selecting multiple paths, the process of Niwayama et al. in 2010 prunes many paths considering their overlapping or crossing affairs with other ones. In this paper, a solution to those stated problems of Niwayama et al. is outlined and successful results found are demonstrated here too. First, an imperfect maze is tried to be changed virtually to a perfect maze. Then solution paths from start to end are generated. While generating solution paths, the longest path among them is considered to cross or join a point along their pathways. Therefore, one path among those imperfect paths is considered embedded at and extraction was not employed by any earlier proposal, so far we know. Contribution to the stated research area will increase the embedding capacity. For measuring the longest path, the tie is broken by comparing x coordinates and then, if required, y coordinates. The illustrated result in the result analysis section details the justification of our claim.

Keywords


Steganography.

References





DOI: https://doi.org/10.17010/ijcs%2F2022%2Fv7%2Fi1%2F168954