Search arXivSearch

arXiv · 2606.30584

Semantic Noise Aided Secure Image Transmission over MIMO Fading Channels

Abstract

Existing semantic communications have exhibited satisfactory performance in many tasks, but secure image transmission remains insufficiently explored. We propose a novel secure image semantic communication (SISC) framework over multiple-input multiple-output (MIMO) fading channels. To ensure high-quality image reconstruction for the legitimate semantic user (SU) and simultaneously interfere with the eavesdropper (Eve), we design a semantic noise generation (SNG) network. This network generates a beneficial semantic noise map based on both the source features and the SU channel state information (CSI). An efficient channel estimation enhanced network is incorporated to obtain the accurate CSI and enhance the system performance. Furthermore, to improve the secure image reconstruction quality, we develop an efficient transceiver beamformer optimization algorithm, where the formulated problem is solved using the constrained stochastic successive convex approximation method. In the proposed SISC framework, semantic noise generation and beamforming optimization work together to ensure secure and high-quality image transmission. Numerical results demonstrate that the proposed semantic noise aided transmission scheme effectively protects image information from leakage to Eve while maintaining high-fidelity image reconstruction at SU.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xue Han, Biqian Feng, Ting Zhou, Yongpeng Wu, Yuanwei Liu, Arumugam Nallanathan, Xiang-Gen Xia, Wenjun Zhang. 2026-06-29. Semantic Noise Aided Secure Image Transmission over MIMO Fading Channels. https://arxiv.org/abs/2606.30584

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT