Analysis of the Security of Perceptual Image Hashing Based on Non-Negative Matrix Factorization
The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
In this letter, we analyze the security of a perceptual image hashing technique based on non-negative matrix factorization which was recently proposed and reported in the literature. We theoretically demonstrate that, although the technique uses different secret keys in subsequent stages, the first key plays an essential role to secure the hashing system. We next act as an attacker and propose a technique to estimate the secret key. Extensive experiments support our theoretical analysis and validate the proposed key estimation technique.
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
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
Robust 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 1×
“Also, image hashing and watermarking could be complementary in that the watermark has to depend on both a secret key and the image content to eliminate any possibility of estimating the watermark based on watermarked image observations, hence the need for image hashes [3], [4].”
Background
Cited by
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
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
Self-citationRobust image hashing with multidimensional scaling
Tang, Z., Huang, Z., Zhang, X., & Lao, H. (2017) · Signal Processing · doi:10.1016/j.sigpro.2017.02.008 · Cited by 80
Khelifi, F. (2018) · Signal Processing · doi:10.1016/j.sigpro.2017.09.020 · Cited by 63
Self-citation
Metadata
- Authors
- Khelifi, F., & Jiang, J.
- Venue
- IEEE Signal Processing Letters
- Published
- 2010-01
- Volume
- 17
- Issue
- 1
- Pages
- 43-46
- ISSN
- 1070-9908 (ISSN-L)
- 1558-2361
- OpenAlex
- W2097483157
- Cited by
- 39
- References
- 2
- FWCI
- 2.20
- 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: Analysis of the Security of Perceptual Image Hashing Based on Non-Negative Matrix Factorization. https://app.cochat.ai/papers/10.1109/lsp.2009.2032451
- The paper
- Khelifi, F., & Jiang, J. (2010). Analysis of the Security of Perceptual Image Hashing Based on Non-Negative Matrix Factorization. IEEE Signal Processing Letters. https://doi.org/10.1109/lsp.2009.2032451
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.