Unicity Distance of Robust Image Hashing
The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Abstract
An image hash is a randomized compact representation of image content and finds applications in image authentication, image and video watermarking, and image similarity comparison. Usually, an image-hashing scheme is required to be robust and secure, and the security issue is particularly important in applications, such as multimedia authentication, watermarking, and fingerprinting. In this paper, we investigate the security of image hashing from the perspective of unicity distance, a concept pioneered by Shannon in one of his seminal papers. Using two recently proposed image-hashing schemes as representatives, we show that the concept of unicity distance can be adapted to evaluate the security of image hashing. Our analysis shows that the secret hashing key, or its equivalent form, can be estimated with high accuracy when the key is reused several dozen times. The estimated unicity distance determines the maximum number of key reuses in the investigated hashing schemes. A countermeasure of randomized key initialization is discussed to avoid key reuse and strengthen the security of robust image hashing.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Communication Theory of Secrecy Systems
Shannon, C. E. (1949) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1949.tb00928.x · Cited by 9,440 · cited 3×
“We shall demonstrate the same trend in unicity distance for these two image-hashing schemes despite their differences in feature selection and feature randomization.”
BackgroundMethodIntroduction to Numerical Analysis
Stoer, J., & Bulirsch, R. (2002) · Texts in Applied Mathematics · doi:10.1007/978-0-387-21738-3 · Cited by 1,562
A new three-step search algorithm for block motion estimation
Li, R., Zeng, B., & Liou, M. L. (1994) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/76.313138 · Cited by 1,536 · cited 1×
“Our investigation in the security for robust image hashing shows that the secret hashing key, or its equivalent form, can be estimated with high accuracy when the key is reused a few dozen times.”
BackgroundRobust 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
Self-citationRobust hash functions for digital watermarking
Fridrich, J., & Goljan, M. (2002) · Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540) · doi:10.1109/itcc.2000.844203 · Cited by 336 · cited 2×
“The postprocessing of an image feature involves quantization and compression of the feature.”
Method
Cited by
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
Khelifi, F. (2018) · Signal Processing · doi:10.1016/j.sigpro.2017.09.020 · Cited by 63
Robust and Secure Image Fingerprinting Learned by Neural Network
Li, Y., Wang, D., & Tang, L. (2020) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2019.2890966 · Cited by 52
Metadata
- Authors
- Mao, Y., & Wu, M.
- Venue
- IEEE Transactions on Information Forensics and Security
- Published
- 2007-09
- Volume
- 2
- Issue
- 3
- Pages
- 462-467
- ISSN
- 1556-6013 (ISSN-L)
- OpenAlex
- W2103610022
- Cited by
- 52
- References
- 5
- FWCI
- 7.85
- Type
- journal article
- Language
- en
- Open access
- closed
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Unicity Distance of Robust Image Hashing. https://app.cochat.ai/papers/10.1109/tifs.2007.902260
- The paper
- Mao, Y., & Wu, M. (2007). Unicity Distance of Robust Image Hashing. IEEE Transactions on Information Forensics and Security. https://doi.org/10.1109/tifs.2007.902260
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.