CoChat

The DOI matches its Crossref record; 31 of the 32 references it cites were found in a registry or an index; 2 of the 7 sources its claims cite were checked for support.

A Secure and Robust Image Hashing Scheme Using Gaussian Pyramids

Open access
Bashir, Iram, Ahmed, Fawad, Ahmad, Jawad, Boulila, Wadii, Alharbi, Nouf · 2019 · Entropy

Abstract

Image hash is an alternative to cryptographic hash functions for checking integrity of digital images. Compared to cryptographic hash functions, an image hash or a Perceptual Hash Function (PHF) is resilient to content preserving distortions and sensitive to malicious tampering. In this paper, a robust and secure image hashing technique using a Gaussian pyramid is proposed. A Gaussian pyramid decomposes an image into different resolution levels which can be utilized to obtain robust and compact hash features. These stable features have been utilized in the proposed work to construct a secure and robust image hash. The proposed scheme uses Laplacian of Gaussian (LOG) and disk filters to filter the low-resolution Gaussian decomposed image. The filtered images are then subtracted and their difference is used as a hash. To make the hash secure, a key is introduced before feature extraction, thus making the entire feature space random. The proposed hashing scheme has been evaluated through a number of experiments involving cases of non-malicious distortions and malicious tampering. Experimental results reveal that the proposed hashing scheme is robust against non-malicious distortions and is sensitive to detect minute malicious tampering. Moreover, False Positive Probability (FPP) and False Negative Probability (FNP) results demonstrate the effectiveness of the proposed scheme when compared to state-of-the-art image hashing algorithms proposed in the literature.

Overview

CoChat Summary

TL;DR

The paper proposes a secure, robust image hashing scheme based on a 4-level Gaussian pyramid, using key-generated noise for security and LOG/disk filter differences for compact hash generation. Experiments report robustness to non-malicious distortions and sensitivity to tampering smaller than 1% of image area, with low false positive and false negative probabilities.

Key findings

  • A 4-level Gaussian pyramid on a 256×256 image produces a 16×16 hash with 256 entries; hash size is 2304 bits (288 bytes) for noise parameter α between 0 and 1, and 320 bytes for α between 1.5 and 3.
  • The maximum \(d_{\max}\) for non-malicious distortions is 13.5, while the minimum \(d_{\max}\) for tampering is 20, giving a threshold range of 14–19 to separate the two; at threshold \(T_h=20\), FPP is 0.03, and FNP becomes zero when threshold is greater than 15.
  • Key-dependent noise makes the hash sensitive to the secret key: using two different keys on the same image with noise value 2 gives \(d_{\max}=95\), and across 1000 keys on the Baboon image the maximum and minimum changes in \(d_{\max}\) were 264 and 81.
  • The key space is reported as \(10^{90}\), approximately \(2^{299}\), which the authors state is high enough to resist brute-force attacks.

Methods

  • The scheme converts the input to grayscale, resizes to 256×256, adds a key-generated noisy image using TD-ERCS and skew tent map PRNG, applies 4-level Gaussian pyramid decomposition, filters the fourth level with a LOG filter (\(\sigma=0.5\), 5×5 window) and a disk filter (radius 2), and subtracts the filtered images to form the hash.
  • Verification computes the difference matrix between the received image hash and the original hash, comparing each element against a threshold \(T_h\) to localize tampering.
  • Evaluation used test images including Einstein, Cameraman, Flower, Joker, Girl, and Baboon, with tampered areas less than 1% of total image area, and non-malicious distortions including Gaussian noise, speckle noise, motion blurring, average blurring, image sharpening, and JPEG compression; analysis used \(d_{\max}\), threshold selection, FPP/FNP, ROC curves, key sensitivity, and key space.

Limitations

  • The paper does not present a dedicated limitations section. It states that choosing a suitable threshold is still a research challenge, that there is always a trade-off between robustness and discriminative capability, and that no benchmark has been defined for image hashing schemes.
  • The text notes that in the compared state-of-the-art papers, tampering was greater than in the proposed scheme’s tests, and that those papers did not show non-malicious distortion results separately but used cumulative effects to find FNP and FPP.
  • Evident from the text: evaluation is limited to a small set of named test images, tampered areas are all less than 1% of image area, and threshold/filter parameters were selected empirically through experimentation rather than derived analytically.

Model-written summary. Check it against the paper before relying on it.

Integrity signals

Registry

Crossref · 10.3390/e21111132

Cites

31 of 31 references verified0 citation errors · 0 not checkable

Statistics

Nothing to recompute.

Figures

Figure 1 General block diagram of an image hashing scheme.
Figure 1 General block diagram of an image hashing scheme.CC BY · PubMed Central
Figure 2 Illustration of malicious and non-malicious distortions.
Figure 2 Illustration of malicious and non-malicious distortions.CC BY · PubMed Central
Figure 3 Noisy image added to the original image.
Figure 3 Noisy image added to the original image.CC BY · PubMed Central
Figure 4 Illustration of Cameraman image at different values of α.
Figure 4 Illustration of Cameraman image at different values of α.CC BY · PubMed Central
Figure 5 Illustration of Gaussian Pyramid.
Figure 5 Illustration of Gaussian Pyramid.CC BY · PubMed Central
Figure 6 Block diagram of hash generation module.
Figure 6 Block diagram of hash generation module.CC BY · PubMed Central
Figure 7 Block diagram of hash verification module.
Figure 7 Block diagram of hash verification module.CC BY · PubMed Central
Figure 8 Test images and their tampered versions. (Tampering is shown inside the circle.)
Figure 8 Test images and their tampered versions. (Tampering is shown inside the circle.)CC BY · PubMed Central
Figure 9 False Positive Probability vs threshold.
Figure 9 False Positive Probability vs threshold.CC BY · PubMed Central
Figure 10 Receiver Operating Characteristics (ROC) Curves.
Figure 10 Receiver Operating Characteristics (ROC) Curves.CC BY · PubMed Central
Figure 11 Effect of secret key on the Hash.
Figure 11 Effect of secret key on the Hash.CC BY · PubMed Central

Verification

Claims the paper makes

1 Valid · 0 Not valid · 4 Not checked · 69 Own results and interpretations

45 more claims

Create a free account to see all 74 claims and every source verdict.

See all claims — free account
  • It may state two separate claims as one. 20
  • Probably not a substantial claim. 7

Create a free account to see these claims.

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

Each contradiction between two passages listed here was confirmed by an independent check.

1 of 1

Citations

Cites

Show all 31 references

Cited by

See all 20

Metadata

Authors
Bashir, I., Ahmed, F., Ahmad, J., Boulila, W., & Alharbi, N.
Affiliations
  • HITEC University (PK)
  • Edinburgh Napier University (GB)
  • Taibah University (SA)
Corresponding author
Boulila, Wadii
Venue
Entropy
Publisher
MDPI AG
Published
2019-11-19
Volume
21
Issue
11
Pages
1132
ISSN
1099-4300 (ISSN-L)
OpenAlex
W2991005505
Cited by
20
References
32
Citations by year
2024: 3 · 2023: 3 · 2022: 3 · 2021: 7 · 2020: 4
FWCI
1.57
Type
journal article
Language
en
Open access
Locations
  • Entropy (publishedVersion, cc-by)
  • PubMed Central (publishedVersion, cc-by)
  • HAL (submittedVersion)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
  • Edinburgh Napier Research Repository (Edinburgh Napier University) (submittedVersion, cc-by)
Topics
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Steganography and Watermarking Techniques
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Chaos-based Image/Signal Encryption
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Digital Media Forensic Detection
Keywords
image hashing, Gaussian pyramid, Laplacian of Gaussian, disk filter, image integrity verification, tamper detection

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.

The claim verdicts this report counts are experimental: their accuracy is not yet measured.

A language model drew the claims from the paper on 2026-10-10, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).

A second model labelled each claim on 2026-10-10 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).

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: A Secure and Robust Image Hashing Scheme Using Gaussian Pyramids. https://app.cochat.ai/papers/10.3390/e21111132
The paper
Bashir, I., Ahmed, F., Ahmad, J., Boulila, W., & Alharbi, N. (2019). A Secure and Robust Image Hashing Scheme Using Gaussian Pyramids. Entropy. https://doi.org/10.3390/e21111132

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.