Robust hash functions for digital watermarking
Abstract
Digital watermarks have been proposed for authentication of both video data and still images and for integrity verification of visual multimedia. In such applications, the watermark has to depend on a secret key and on the original image. It is important that the dependence on the key be sensitive, while the dependence on the image be continuous (robust). Both requirements can be satisfied using special image digest functions that return the same bit-string for a whole class of images derived from an original image using common processing operations. It is further required that two completely different images produce completely different bit-strings. We discuss methods how such robust hash functions can be built. We also show how the hash bits has another application, the robust image digest can be used as a search index for an efficient image database search.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Cites
Visual pattern recognition by moment invariants
Hu, M.-K. (1962) · IRE Transactions on Information Theory · doi:10.1109/tit.1962.1057692 · Cited by 7,594 · see citing works
Rotation, scale and translation invariant digital image watermarking
O'Ruanaidh, J. J., & Pun, T. (2002) · Proceedings - International Conference on Image Processing · doi:10.1109/icip.1997.647968 · Cited by 363 · see citing works
Some general methods for tampering with watermarks
Cox, I. J., & Linnartz, J. M. G. (1998) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.668980 · Cited by 224 · see citing works
Data hiding for video-in-video
Swanson, M. D., Zhu, B., & Tewfik, A. H. (2002) · Proceedings - International Conference on Image Processing · doi:10.1109/icip.1997.638586 · Cited by 121 · see citing works
Public watermarks and resistance to tampering
Cox, I. J., & Linnartz, J. M. G. (2005) · Proceedings - International Conference on Image Processing · doi:10.1109/icip.1997.632226 · Cited by 119 · see citing works
Robust bit extraction from images
Fridrich, J. (2003) · IEEE International Conference on Multimedia Computing and Systems (ICMCS) · doi:10.1109/mmcs.1999.778542 · Cited by 117 · see citing works
Self-citationThe Information Theoretical Significance of Spatial and Temporal Masking in Video Signals
Girod, B. (1989) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.952716 · Cited by 114 · see citing works
A class of authentication digital watermarks for secure multimedia communication
Me, L., & Arce, G. R. (2001) · IEEE Transactions on Image Processing · doi:10.1109/83.967402 · Cited by 107 · see citing works
Visual hash for oblivious watermarking
Fridrich, J. (2000) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.384982 · Cited by 87 · see citing works
Self-citationRotation, Translation and Scale Invariant Digital Image Watermarking
O'Ruanaidh, J. J., & Pun, T. (1997) · Cited by 79 · see citing works
Generating Robust Digital Signature for Image/Video Authentication
Lin, C., & Chang, S. (1998) · Cited by 76 · see citing works
Representations that uniquely characterize images modulo translation, rotation, and scaling
Brandt, R., & Lin, F. (1996) · Pattern Recognition Letters · doi:10.1016/0167-8655(96)00062-1 · Cited by 35 · see citing works
Progressive quantized projection watermarking scheme
Alghoniemy, M. B., & Tewfik, A. H. (1999) · ACM International Conference on Multimedia (ACM MM) · doi:10.1145/319463.319629 · Cited by 26 · see citing works
Flagged first, then by citations
Cited by
Sorted by citations
Robust and secure image hashing
Swaminathan, A., Mao, Y., & Wu, M. (2006) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2006.873601 · Cited by 552 · see citing works
Perceptual Image Hashing Via Feature Points: Performance Evaluation and Tradeoffs
Monga, V., & Evans, B. L. (2006) · IEEE Transactions on Image Processing · doi:10.1109/tip.2006.881948 · Cited by 363 · see citing works
Robust Image Hashing With Ring Partition and Invariant Vector Distance
Tang, Z., Zhang, X., Li, X., & Zhang, S. (2016) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2015.2485163 · Cited by 247 · see citing works
Robust Image Hashing with Tensor Decomposition
Tang, Z., Chen, L., Zhang, X., & Zhang, S. (2019) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2018.2837745 · Cited by 134 · see citing works
Perceptual image hashing based on virtual watermark detection
Khelifi, F., & Jiang, J. (2010) · IEEE Transactions on Image Processing · doi:10.1109/tip.2009.2038637 · Cited by 107 · see citing works
Robust image hashing using non-uniform sampling in discrete Fourier domain
Qin, C., Chang, C.-C., & Tsou, P.-L. (2013) · Digital Signal Processing · doi:10.1016/j.dsp.2012.11.002 · Cited by 81 · see citing works
Qin, C., Liu, E., Feng, G., & Zhang, X. (2021) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2020.3047142 · Cited by 78 · see citing works
Deep Perceptual Hash Based on Hash Center for Image Copyright Protection
Sun, X., & Zhou, J. (2022) · IEEE Access · doi:10.1109/access.2022.3221980 · Cited by 20 · see citing works
“Fridrich et al. replaced the DCT modes with the low-frequency DC-free random smoothing patterns generated from a secret key, and then quantized it through the threshold to generate a specific length of image hash sequence [7].”
BackgroundHamming distributions of popular perceptual hashing techniques
McKeown, S., & Buchanan, W. J. (2023) · Forensic Science International: Digital Investigation · doi:10.1016/j.fsidi.2023.301509 · Cited by 15 · see citing works
National Institute of Standards and Technology (US) (2024) · doi:10.6028/nist.ai.100-4 · Cited by 9 · see citing works
Perceptual authentication hashing for digital images based on multi-domain feature fusion
Cao, F., Yao, S., Zhou, Y., Yao, H., & Qin, C. (2024) · Signal Processing · doi:10.1016/j.sigpro.2024.109576 · Cited by 8 · see citing works
- Authors
- Fridrich, J., & Goljan, M.
- Affiliations
- Binghamton University (US)
- ORCID
- Fridrich, J.
- Venue
- Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540)
- Publisher
- IEEE Comput. Soc
- Published
- 2002-11-07
- Pages
- 178-183
- OpenAlex
- W1647732624
- Cited by
- 336
- References
- 13
- Citations by year
- 2026: 1 · 2025: 2 · 2024: 7 · 2023: 8 · 2022: 8 · 2021: 14 · 2020: 12 · 2019: 8 · 2018: 9 · 2017: 12 · 2016: 19 · 2015: 22 · 2014: 15 · 2013: 20 · 2012: 26
- FWCI
- 7.03
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- International Conference on Information Technology: Coding and Computing (ITCC) (publishedVersion)
- Funders
- U.S. Air Force
- Topics
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Steganography and Watermarking Techniques
- Physical Sciences › Computer Science › Artificial Intelligence › Computer Science and Engineering
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Chaos-based Image/Signal Encryption
- Keywords
- digital watermarking, image authentication, image integrity verification, image database search, multimedia authentication
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
