Confusion/Diffusion Capabilities of Some Robust Hash Functions
The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
Perceptual hash functions have been recently proposed as cryptographic primitives for multimedia security applications. However, many of these hash functions have been designed with signal processing robustness issues and have not addressed the key issues of confusion and diffusion that are central to the security of conventional hash functions. In this paper we give a definition for confusion and diffusion for perceptual hash functions and show how many common perceptual hash functions do not display desirable confusion/diffusion properties.
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
Image quality assessment: from error visibility to structural similarity
Wang, Z., Bovik, A. C., Sheikh, H. R., & Simoncelli, E. P. (2004) · IEEE Transactions on Image Processing · doi:10.1109/tip.2003.819861 · Cited by 57,892
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 2×
“Since confusion and diffusion were first proposed by Shannon [4] in 1949, they have been extensively used to evaluate”
MethodInfluentialRobust 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 by
Robust and Secure Image Hashing via Non-Negative Matrix Factorizations
Monga, V., & Mihcak, M. K. (2007) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2007.902670 · Cited by 295
(2010) · Cited by 230
A secure and robust hash-based scheme for image authentication
Ahmed, F., Siyal, M. Y., & Uddin Abbas, V. (2010) · Signal Processing · doi:10.1016/j.sigpro.2009.05.024 · Cited by 189
Unified Performance Evaluation Method for Perceptual Image Hashing
Li, X., Qin, C., Wang, Z., Qian, Z., & Zhang, X. (2022) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2022.3161149 · Cited by 32
Metadata
- Authors
- Coskun, B., & Memon, N.
- Venue
- 2006 40th Annual Conference on Information Sciences and Systems
- Publisher
- IEEE
- Published
- 2006-03
- Pages
- 1188-1193
- OpenAlex
- W2146482978
- Cited by
- 58
- References
- 3
- FWCI
- 4.52
- Type
- conference paper
- 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: Confusion/Diffusion Capabilities of Some Robust Hash Functions. https://app.cochat.ai/papers/10.1109/ciss.2006.286645
- The paper
- Coskun, B., & Memon, N. (2006). Confusion/Diffusion Capabilities of Some Robust Hash Functions. 2006 40th Annual Conference on Information Sciences and Systems. https://doi.org/10.1109/ciss.2006.286645
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.