Toward Resisting Black-Box Attacks: A Robust Coverless Image Steganography Based on Hierarchical CID and Dual SIFT

Coverless image steganography (CIS) can completely resist steganalysis algorithms as it does not modify the carriers. However, most existing CIS methods overlook the diversity of generated hash sequences, which directly impacts the practical maximum capacity and difficulty of constructing the index structure. Moreover, CIS methods typically consider robustness only under known parameters. In security, some methods require the transmission of auxiliary information along with stego images, while others reuse fixed images in the dataset, which raises potential suspicion from attackers. To address the above issues, a robust CIS method towards resisting black-box attacks is proposed. The normalized average of keypoint descriptor features is calculated by Scale-Invariant Feature Transform (SIFT) to construct the hierarchical coverless image dataset (CID). Subsequently, the mapping table between hash sequences and images in CID is established to accomplish secret information hiding and extraction. Experimental results demonstrate that the proposed CIS method achieves a higher capacity and stronger robustness than the state-of-the-art CIS methods. Notably, it is the first time to consider robustness against black-box and mixed attacks in CIS methods, making it more applicable to real-world scenarios.

Institutions

Publication Details

Journal
IEEE Transactions on Dependable and Secure Computing
Published
2025-09-23
DOI
https://doi.org/10.1109/tdsc.2025.3613525
Primary Topic
Diverse Scientific and Economic Studies
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Toward Resisting Black-Box Attacks: A Robust Coverless Image Steganography Based on Hierarchical CID and Dual SIFT

IEEE Transactions on Dependable and Secure Computing
Diverse Scientific and Economic Studies
article

Toward Resisting Black-Box Attacks: A Robust Coverless Image Steganography Based on Hierarchical CID and Dual SIFT

article en

Abstract

Coverless image steganography (CIS) can completely resist steganalysis algorithms as it does not modify the carriers. However, most existing CIS methods overlook the diversity of generated hash sequences, which directly impacts the practical maximum capacity and difficulty of constructing the index structure. Moreover, CIS methods typically consider robustness only under known parameters. In security, some methods require the transmission of auxiliary information along with stego images, while others reuse fixed images in the dataset, which raises potential suspicion from attackers. To address the above issues, a robust CIS method towards resisting black-box attacks is proposed. The normalized average of keypoint descriptor features is calculated by Scale-Invariant Feature Transform (SIFT) to construct the hierarchical coverless image dataset (CID). Subsequently, the mapping table between hash sequences and images in CID is established to accomplish secret information hiding and extraction. Experimental results demonstrate that the proposed CIS method achieves a higher capacity and stronger robustness than the state-of-the-art CIS methods. Notably, it is the first time to consider robustness against black-box and mixed attacks in CIS methods, making it more applicable to real-world scenarios.

IEEE Transactions on Dependable and Secure ComputingVol. 23(1)
City University of Hong Kong (HK), Shanghai Jiao Tong University (CN)
Openalex Percentile: Top 35%
Diverse Scientific and Economic Studies
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.