A Blind Image Steganography Algorithm Based on Knight Tour Algorithm and QR Codes

Authors

  • Younis Mohammed Younis Department of Computer Science, University of Zakho Kurdistan Region, Iraq
  • Ramadhan J. Mstafa Department of Computer Science, University of Zakho Kurdistan Region, Iraq (and Department of Computer Science, Nawroz University, Duhok, KRG - Iraq)
  • Haval I. Hussein Department of Computer Science, University of Zakho Kurdistan Region, Iraq
  • Ahmed L. Alyousify Department of Computer Science, University of Zakho Kurdistan Region, Iraq

DOI:

https://doi.org/10.25007/ajnu.v12n3a1891

Keywords:

Image Steganography, FAST feature points, QR code, blind model, knight tour algorithm

Abstract

Internet proliferation and technological progress have made multimedia information quickly accessible, but they have also posed a threat to privacy and security. Researchers have been interested in digital images due to their capacity to store large amounts of data due to the possibility of protecting sensitive information through digital steganography. Despite their visual imperceptibility, robustness, and ability to embed information, existing image steganography techniques face several challenges. To overcome these challenges, a novel image steganography approach based on a blind model strategy has been proposed for hiding covert messages. The model consists of two stages: embedding and extracting. In the embedding stage, a suitable cover image is selected using the FAST feature point detector. A text message is then converted to a QR code and embedded in the feature points' neighbors using knight tour steps in a chess game. The result is a stego image that appears identical to the original cover image but contains the secret message in its feature points' neighbors. The extracting stage involves finding the feature points and extracting the QR code to obtain the original text message. Since the feature points were not altered during the embedding process, the proposed model is known as a blind model. This approach eliminates the need for the original cover image during the extracting stage. The proposed model was evaluated using several metrics, including the peak signal-to-noise ratio (PSNR) and structural similarity index (SSIM). The results demonstrate that the proposed algorithm can effectively embed and extract secret messages with high accuracy while maintaining the visual quality of the cover image with 100% of (SSIM), and 73.48 as an average of (PSNR).

Downloads

Download data is not yet available.

References

Abboud, G., Marean, J., & Yampolskiy, R. V. (2010). Steganography and Visual Cryptography in Computer Forensics. 2010 Fifth IEEE International Workshop on Systematic Approaches to Digital Forensic Engineering, 25–32. https://doi.org/10.1109/SADFE.2010.14

Astuti, E. Z., Setiadi, D. R. I. M., Rachmawanto, E. H., Sari, C. A., & Sarker, M. K. (2020). LSB-based Bit Flipping Methods for Color Image Steganography. Journal of Physics: Conference Series, 1501(1). https://doi.org/10.1088/1742-6596/1501/1/012019

Bajpai, M. K. (2015). Researching through QR codes in libraries. 2015 4th International Symposium on Emerging Trends and Technologies in Libraries and Information Services, 291–294. https://doi.org/10.1109/ETTLIS.2015.7048214

Bhatia, M. K. (2019). Knight tour for image steganography technique. International Journal of Engineering and Advanced Technology, 9(1), 1610–1613. https://doi.org/10.35940/ijeat.F8736.109119

Chakraborty, S., & Jalal, A. S. (2020). A novel local binary pattern based blind feature image steganography. Multimedia Tools and Applications, 79(27–28), 19561–19574. https://doi.org/10.1007/s11042-020-08828-3

Database, T. U.-S. I. (n.d.). DATA Set. The USC-SIPI Image Database. https://sipi.usc.edu/database/database.php?volume=misc&image=12#top

Huang, J., Cheng, S., Lou, S., & Jiang, F. (2019). Image steganography using texture features and GANs. Proceedings of the International Joint Conference on Neural Networks, 2019-July(July), 1–8. https://doi.org/10.1109/IJCNN.2019.8852252

Luo, H., & Yu, F. (2008). Data Hiding in Image Size Invariant Visual Cryptography. 2008 3rd International Conference on Innovative Computing Information and Control, 25–25. https://doi.org/10.1109/ICICIC.2008.680

Mohammed, A. O., Hussein, H. I., Mstafa, R. J., & Abdulazeez, A. M. (2023). A blind and robust color image watermarking scheme based on DCT and DWT domains. Multimedia Tools and Applications. https://doi.org/10.1007/s11042-023-14797-0

Mstafa, R. J., & Elleithy, K. M. (2016). An adaptive Video Steganography Method Based on the Multiple Object Tracking and Hamming Codes Abstract : Hamming Codes : Introduction : Conclusions : References : July, 4. https://doi.org/10.13140/RG.2.2.14397.56803

Parberry, I. (1997). An efficient algorithm for the Knight’s tour problem. Discrete Applied Mathematics, 73(3), 251–260. https://doi.org/10.1016/S0166-218X(96)00010-8

Setiadi, D. R. I. M. (2021). PSNR vs SSIM: imperceptibility quality assessment for image steganography. Multimedia Tools and Applications, 80(6), 8423–8444. https://doi.org/10.1007/s11042-020-10035-z

Shanthakumari, R., & Malliga, S. (2020). Dual layer security of data using LSB inversion image steganography with elliptic curve cryptography encryption algorithm. Multimedia Tools and Applications, 79(5–6), 3975–3991. https://doi.org/10.1007/s11042-019-7584-6

Sultana, H., Kamal, A. H. M., Hossain, G., & Kabir, M. A. (2023). A Novel Hybrid Edge Detection and LBP Code-Based Robust Image Steganography Method. Future Internet, 15(3), 108. https://doi.org/10.3390/fi15030108

Trajković, M., & Hedley, M. (1998). Fast corner detection. Image and Vision Computing, 16(2), 75–87. https://doi.org/10.1016/s0262-8856(97)00056-5

ur Rehman, A., Rahim, R., Nadeem, S., & ul Hussain, S. (2019). End-to-end trained CNN encoder-decoder networks for image steganography. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 11132 LNCS, 723–729. https://doi.org/10.1007/978-3-030-11018-5_64

Younis, Y. M., Mstafa, R. J., & Atto, M. (2019). Video Information Hiding Based on Feature Points and Arnold Cat Algorithm. 2019 International Conference on Advanced Science and Engineering (ICOASE), 198–203. https://doi.org/10.1109/ICOASE.2019.8723729

Downloads

Published

2023-08-11

How to Cite

Mohammed Younis, Y., J. Mstafa, R., I. Hussein, H., & L. Alyousify, A. (2023). A Blind Image Steganography Algorithm Based on Knight Tour Algorithm and QR Codes. Academic Journal of Nawroz University, 12(3), 332–343. https://doi.org/10.25007/ajnu.v12n3a1891

Issue

Vol. 12 No. 3 (2023)

Section

Articles

License

Copyright (c) 2023 Academic Journal of Nawroz University

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Authors retain copyright

The use of a Creative Commons License enables authors/editors to retain copyright to their work. Publications can be reused and redistributed as long as the original author is correctly attributed.

 

  1. Copyright

 

  1. The researcher(s), whether a single or joint research paper, must sell and transfer to the publisher (the Academic Journal of Nawroz University) through all the duration of the publication which starts from the date of entering this Agreement into force, the exclusive rights of the research paper/article. These rights include the translation, reuse of papers/articles, transmit or distribute, or use the material or parts(s) contained therein to be published in scientific, academic, technical, professional journals or any other periodicals including any other works derived from them, all over the world, in English and Arabic, whether in print or in electronic edition of such journals and periodicals in all types of media or formats now or that may exist in the future. Rights also include giving license (or granting permission) to a third party to use the materials and any other works derived from them and publish them in such journals and periodicals all over the world. Transfer right under this Agreement includes the right to modify such materials to be used with computer systems and software, or to reproduce or publish it in e-formats and also to incorporate them into retrieval systems.

 

  1. Reproduction, reference, transmission, distribution or any other use of the content, or any parts of the subjects included in that content in any manner permitted by this Agreement, must be accompanied by mentioning the source which is (the Academic Journal of Nawroz University) and the publisher in addition to the title of the article, the name of the author (or co-authors), journal’s name, volume or issue, publisher's copyright, and publication year.

 

  1. The Academic Journal of Nawroz University reserves all rights to publish research papers/articles issued under a “Creative Commons License (CC BY-NC-ND 4.0) which permits unrestricted use, distribution, and reproduction of the paper/article by any means, provided that the original work is correctly cited.

 

  1. Reservation of Rights

The researcher(s) preserves all intellectual property rights (except for the one transferred to the publisher under this Agreement).

  1. Researcher’s guarantee

The researcher(s) hereby guarantees that the content of the paper/article is original. It has been submitted only to the Academic Journal of Nawroz University and has not been previously published by any other party.

In the event that the paper/article is written jointly with other researchers, the researcher guarantees that he/she has informed the other co-authors about the terms of this agreement, as well as obtaining their signature or written permission to sign on their behalf.

The author further guarantees:

  • The research paper/article does not contain any defamatory statements or illegal comments.
  • The research paper/article does not violate other's rights (including but not limited to copyright, patent, and trademark rights).

This research paper/article does not contain any facts or instructions that could cause damages or harm to others, and publishing it does not lead to disclosure of any confidential information.