Semantic Leakage and Privacy Preservation in Relay-Assisted Semantic Communications

• URL: http://arxiv.org/abs/2606.31973v1
• Date: Tue, 30 Jun 2026 17:15:23 GMT
• Title: Semantic Leakage and Privacy Preservation in Relay-Assisted Semantic Communications
• Abstract summary: Semantic communication (SemCom) has emerged as a promising paradigm in which the transmission of task-relevant information is prioritized over raw data.<n>In this paper, the privacy implications of relay-assisted SemCom systems are studied, where the intermediate relay node operates directly on learned latent representations.<n>An adversarial training framework is proposed in which a strong, adaptively trained eavesdropper at the relay is explicitly accounted for.
• Score: 49.494000480610225
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Semantic communication (SemCom) has emerged as a promising paradigm in which the transmission of task-relevant information is prioritized over raw data, enabling efficient and robust communication under resource and channel constraints. In this paper, the privacy implications of relay-assisted SemCom systems are studied, where the intermediate relay node operates directly on learned latent representations. It is shown that the relay, even without access to source data, can reliably infer semantic meaning and reconstruct signals with performance comparable to that of the legitimate receiver, revealing a fundamental privacy vulnerability of semantic representations. To address this issue, an iterative adversarial training framework is proposed in which a strong, adaptively trained eavesdropper at the relay is explicitly accounted for. The proposed approach alternates between optimizing the relay's eavesdropping function and the legitimate system, resulting in representations that preserve semantic decoding performance at the intended receiver while degrading semantic inference at the relay. The semantic accuracy gap between the legitimate receiver and the eavesdropper is significantly enlarged across channel conditions. Importantly, this protection is achieved in a stealthy manner, with high reconstruction fidelity maintained while semantic leakage is selectively suppressed.

Related papers

• Privacy-Preserving Semantic Communications via Multi-Task Learning and Adversarial Perturbations [49.494000480610225]
  This paper presents a deep learning-based semantic communication framework.<n>It supports multiple receiver tasks while explicitly limiting semantic leakage to an eavesdropper.<n>A perturbation layer is successful in reducing semantic leakage even when the legitimate link is trained only for its own task.
  arXiv  Detail & Related papers  (2025-12-30T20:19:49Z)
• Shuffling for Semantic Secrecy [12.708217189207828]
  We devise a novel semantic security communication system wherein the random shuffling pattern plays the role of the shared secret key.<n>The proposed random shuffling method also exhibits its flexibility in working for the existing semantic communication system as a plugin.
  arXiv  Detail & Related papers  (2025-07-10T03:42:17Z)
• Diffusion-aided Task-oriented Semantic Communications with Model Inversion Attack [8.014010065113707]
  We propose DiffSem, a diffusion-aided framework for task-oriented semantic communication.<n>DiffSem integrates a transmitter-side self-noising mechanism that adaptively regulates semantic content while compensating for channel noise.<n>Our experiments demonstrate that DiffSem enables the legitimate receiver to achieve higher accuracy, thereby validating the superior performance of the proposed framework.
  arXiv  Detail & Related papers  (2025-06-24T05:21:27Z)
• Distributionally Robust Wireless Semantic Communication with Large AI Models [111.47794569742206]
  Current SemCom systems fail to generalize across diverse noise conditions, adversarial attacks, and out-of-distribution data.<n>Wasserstein distributionally robust optimization is employed to provide resilience against semantic misinterpretation and channel perturbations.<n> Experimental results on image and text transmission demonstrate that WaSeCom achieves improved robustness under noise and adversarial perturbations.
  arXiv  Detail & Related papers  (2025-05-28T04:03:57Z)
• Task-Adaptive Semantic Communications with Controllable Diffusion-based Data Regeneration [45.55410059471241]
  Next-generation networking shifts bit-wise data delivery to conveying semantic meanings for bandwidth efficiency.<n>This work presents a novel task-adaptive semantic communication framework based on diffusion models.<n>Test results demonstrate the efficacy of the proposed method in adaptively preserving task-relevant information for semantic communications.
  arXiv  Detail & Related papers  (2025-05-12T18:23:53Z)
• Enhancing Privacy in Semantic Communication over Wiretap Channels leveraging Differential Privacy [51.028047763426265]
  Semantic communication (SemCom) improves transmission efficiency by focusing on task-relevant information.<n> transmitting semantic-rich data over insecure channels introduces privacy risks.<n>This paper proposes a novel SemCom framework that integrates differential privacy mechanisms to protect sensitive semantic features.
  arXiv  Detail & Related papers  (2025-04-23T08:42:44Z)
• Secure Semantic Communication via Paired Adversarial Residual Networks [59.468221305630784]
  This letter explores the positive side of the adversarial attack for the security-aware semantic communication system. A pair of matching pluggable modules is installed: one after the semantic transmitter and the other before the semantic receiver. The proposed scheme is capable of fooling the eavesdropper while maintaining the high-quality semantic communication.
  arXiv  Detail & Related papers  (2024-07-02T08:32:20Z)
• Reasoning with the Theory of Mind for Pragmatic Semantic Communication [62.87895431431273]
  A pragmatic semantic communication framework is proposed in this paper. It enables effective goal-oriented information sharing between two-intelligent agents. Numerical evaluations demonstrate the framework's ability to achieve efficient communication with a reduced amount of bits.
  arXiv  Detail & Related papers  (2023-11-30T03:36:19Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.