CoChat

Social Image Security with Encryption and Watermarking in Hybrid Domains

Open access

The DOI matches its Crossref record; 46 of the 46 references it cites were found in a registry or an index.

Abstract

In this digital era, social images are the most vital information carrier on multimedia social platforms. More and more users are interested in sharing social images with mobile terminals on multimedia social platforms. Social image sharing also faces potential risks from malicious use, such as illegal sharing, piracy, and misappropriation. This paper mainly concentrates on secure social image sharing. To address how to share social images in a safe way, a social image security scheme is proposed. The technology addresses the social image security problem and the active tracing problem. First, discrete wavelet transform (DWT) is performed directly from the JPEG image. Then, the high-bit planes of the LL, LH, and HL are permuted with cellular automation (CA), bit-XOR, and singular value decomposition (SVD) computing, and their low-bit planes are chosen to embed a watermark. In the end, the encrypted and watermarked image is again permuted with cellular automation in the discrete cosine transform (DCT) domain. Experimental results and security analysis show that the social image security method not only has good performance in robustness, security, and time complexity but can also actively trace the illegal distribution of social images. The proposed social image security method can provide double-level security for multimedia social platforms.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.3390/e27030276

Cites

46 of 46 references verified0 citation errors · 0 not checkable

Statistics

Figures

Figure 1 The DPV production scheme: (a) labeled binary tree; (b) the interval corresponding to the tree in (a); (c) the corresponding complete binary tree.
Figure 1 The DPV production scheme: (a) labeled binary tree; (b) the interval corresponding to the tree in (a); (c) the corresponding complete binary tree.CC BY · PubMed Central
Figure 2 The GoL scheme: superior, the initial seed of GoL; middle, the original images; inferior, the scrambled images.
Figure 2 The GoL scheme: superior, the initial seed of GoL; middle, the original images; inferior, the scrambled images.CC BY · PubMed Central
Figure 3 Encoding using social network analysis.
Figure 3 Encoding using social network analysis.CC BY · PubMed Central
Figure 4 The proposed security scheme.
Figure 4 The proposed security scheme.CC BY · PubMed Central
Figure 5 Encrypted and decrypted results: (a) The plain image. (b) The cipher image. (c) The reconstructed image with a different initial value. (d) The reconstructed image with correct parameters.
Figure 5 Encrypted and decrypted results: (a) The plain image. (b) The cipher image. (c) The reconstructed image with a different initial value. (d) The reconstructed image with correct parameters.CC BY · PubMed Central
Figure 6 Experimental results: (a) Original images. (b) Initial histograms. (c) Encrypted images. (d) Encrypted histograms.
Figure 6 Experimental results: (a) Original images. (b) Initial histograms. (c) Encrypted images. (d) Encrypted histograms.CC BY · PubMed Central
Figure 7 Correlation: (a) original image; (b) encrypted image.
Figure 7 Correlation: (a) original image; (b) encrypted image.CC BY · PubMed Central
Figure 8 Encryption process discussion: (a) original images; (b) 4×4 block permutation across the high-bit planes of the LL, LH, and HL sub-bands; (c) single-coefficient permutation across the high-bit planes of the LL, LH, and HL sub-bands; (d) bit-XOR diffusion after 8×8 block permutation across the high-bit planes of the LL, LH, and HL sub-bands; and (e) SVD diffusion of (d).
Figure 8 Encryption process discussion: (a) original images; (b) 4×4 block permutation across the high-bit planes of the LL, LH, and HL sub-bands; (c) single-coefficient permutation across the high-bit planes of the LL, LH, and HL sub-bands; (d) bit-XOR diffusion after 8×8 block permutation across the high-bit planes of the LL, LH, and HL sub-bands; and (e) SVD diffusion of (d).CC BY · PubMed Central

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 46 references

Cited by

See all 50

Metadata

Authors
Ye, C., Tan, S., Wang, J., Shi, L., Zuo, Q., & Feng, W.
Affiliations
  • Hubei University Of Economics (CN)
  • School of Information Engineering, Hubei University of Economics, Wuhan 430205, China
  • Panzhihua University (CN)
Corresponding author
Feng, Wei
Venue
Entropy
Publisher
MDPI AG
Published
2025-03-06
Volume
27
Issue
3
Pages
276
ISSN
1099-4300 (ISSN-L)
OpenAlex
W4408189996
Cited by
49
References
46
Citations by year
2026: 16 · 2025: 33
FWCI
17.20
Type
journal article
Language
en
Open access
Locations
  • Entropy (publishedVersion, cc-by)
  • PubMed Central (publishedVersion, cc-by)
  • PubMed (publishedVersion)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
Funders
  • NSF of China (61502154, 61972136, 52201363, 2024AFB544, Q20232206, 23Y116)
  • NSF of Chinese Hubei Province (61502154, 61972136, 52201363, 2024AFB544, Q20232206, 23Y116)
  • Hubei Provincial Department of Education (61502154, 61972136, 52201363, 2024AFB544, Q20232206, 23Y116)
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 › Advanced Data Compression Techniques
Keywords
image watermarking, image encryption, cellular automata, discrete wavelet transform, singular value decomposition, discrete cosine transform

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: Social Image Security with Encryption and Watermarking in Hybrid Domains. https://app.cochat.ai/papers/10.3390/e27030276
The paper
Ye, C., Tan, S., Wang, J., Shi, L., Zuo, Q., & Feng, W. (2025). Social Image Security with Encryption and Watermarking in Hybrid Domains. Entropy. https://doi.org/10.3390/e27030276

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.