TARU PUBLICATIONS
Journal of Discrete Mathematical Sciences and Cryptography cover
Open Access ·Peer-reviewed·ISSN (Online): 2169-0065·ISSN (Print): 0972-0529

Monthly Journal: Publishes theoretical and applied research in all areas of Discrete Mathematical Sciences, Cryptography, Combinatorics, Elliptic Curves and Information Security.

Issues up to 2022 co-published with and available at:Taylor & Francis Online
submissions@tarupublications.com
Open Access Research Article

Analysis of the robustness and cryptographic security of a DCT-based image watermarking scheme

, , , , , *

* Corresponding author · click or hover a name for details

pp. 3049–3058Vol. 28Issue 8December 2025DOI: 10.47974/JDMSC-2466 Crossmark XML
Received:
04 Mar 2025
Published Online:
08 Dec 2025
Article type:
Research Article
Language:
EN
Article no.:
JDMSC-2466
Pages:
3049–3058

Abstract

Image watermarking is a crucial technique used to protect digital media from unauthorized access and ensure copyright security. In cryptography, image watermarking is the process of encoding visible or hidden data onto digital photographs for uses like secure communication, copyright protection, and authentication. By identifying unlawful changes, it protects image integrity and aids in ownership verification. However, the effectiveness of a watermarking system depends significantly on its robustness against various attacks and understanding how different attacks can affect the quality of watermarked images. In this paper, the performance of a discrete cosine transforms (DCT) based image watermarking scheme is analyzed in the presence of different security attacks like salt-pepper noise, median and motion attacks. The performance is evaluated both visually and by MSE parameters.

Keywords

Subject Classifications

Primary 93A30Secondary 49K15

References

[1] F. Deeba, S. Kun, F. A. Dharejo, and H. Memon, “Digital image watermarking based on ANN and least significant bit,” Information Security Journal: A Global Perspective, vol. 29, no. 1, pp. 30–39 (Jan. 2020), doi: 10.1080/19393555.2020.1717684.
[2] B. P. Kumari and V. P. S. Rallabandi, “Modified patchwork-based watermarking scheme for satellite imagery,” Signal Processing, vol. 88, no. 4, pp. 891–904 (2008), doi: 10.1016/j.sigpro.2007.10.009.
[3] W. Alomoush, O. AlSheikh, A. Alsghaier, S. Al Zu’bi, and K. Alzoubi, “Digital image watermarking using discrete cosine transformation based linear modulation,” Journal of Cloud Computing, vol. 12, no. 1, pp. 96 (2023), doi: 10.1186/s13677-023-00468-w.
[4] A. Akter, Nur-E-Tajnina, and M. A. Ullah, “Digital image watermarking based on DWT-DCT: Evaluate for a new embedding algorithm,” in Proc. 2014 Int. Conf. Informatics, Electronics & Vision (ICIEV), pp. 1–6 (2014), doi: 10.1109/ICIEV.2014.6850699.
[5] M. Begum and M. S. Uddin, “Implementation of secured and robust DFT-based image watermark through hybridization with decomposition algorithm,” SN Computer Science, vol. 2, no. 3, pp. 221 (2021), doi: 10.1007/s42979-021-00608-6.
[6] A. Rai and H. V. Singh, “SVM based robust watermarking for enhanced medical image security,” Multimedia Tools and Applications, vol. 76, no. 18, pp. 18605–18618 (2017), doi: 10.1007/s11042-016-4215-3.
[7] R. Mehta, V. P. Vishwakarma, and N. Rajpal, “Lagrangian support vector regression based image watermarking in wavelet domain,” in Proc. 2015 2nd Int. Conf. Signal Processing and Integrated Networks (SPIN), pp. 854–859 (2015), doi: 10.1109/SPIN.2015.7095436.
[8] H. K. Singh and A. K. Singh, “Digital image watermarking using deep learning,” Multimedia Tools and Applications, vol. 83, no. 1, pp. 2979–2994 (2024), doi: 10.1007/s11042-023-15750-x.
[9] M. W. Hatoum, J.-F. Couchot, R. Couturier, and R. Darazi, “Using deep learning for image watermarking attack,” Signal Processing: Image Communication, vol. 90, pp. 116019 (2021), doi: 10.1016/j.image.2020.116019.
[10] B. Wang, S. Jiawei, W. Wang, and P. Zhao, “Image copyright protection based on blockchain and zero-watermark,” IEEE Transactions on Network Science and Engineering, vol. 9, no. 4, pp. 2188–2199 (2022), doi: 10.1109/TNSE.2022.3157867.

Views: 136Downloads: 7Citations: 0