Shuffling for Semantic Secrecy

• URL: http://arxiv.org/abs/2507.07401v1
• Date: Thu, 10 Jul 2025 03:42:17 GMT
• Title: Shuffling for Semantic Secrecy
• Authors: Fupei Chen, Liyao Xiang, Haoxiang Sun, Hei Victor Cheng, Kaiming Shen,
• Abstract summary: 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.
• Score: 12.708217189207828
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Deep learning draws heavily on the latest progress in semantic communications. The present paper aims to examine the security aspect of this cutting-edge technique from a novel shuffling perspective. Our goal is to improve upon the conventional secure coding scheme to strike a desirable tradeoff between transmission rate and leakage rate. To be more specific, for a wiretap channel, we seek to maximize the transmission rate while minimizing the semantic error probability under the given leakage rate constraint. Toward this end, we devise a novel semantic security communication system wherein the random shuffling pattern plays the role of the shared secret key. Intuitively, the permutation of feature sequences via shuffling would distort the semantic essence of the target data to a sufficient extent so that eavesdroppers cannot access it anymore. The proposed random shuffling method also exhibits its flexibility in working for the existing semantic communication system as a plugin. Simulations demonstrate the significant advantage of the proposed method over the benchmark in boosting secure transmission, especially when channels are prone to strong noise and unpredictable fading.

Related papers

• 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)
• Semantic Entropy Can Simultaneously Benefit Transmission Efficiency and Channel Security of Wireless Semantic Communications [55.54210451136529]
  We propose SemEntropy to explore semantics of data for both adaptive transmission and physical layer encryption.<n>We show that SemEntropy can keep the semantic accuracy remain 95% with 60% less transmission.
  arXiv  Detail & Related papers  (2024-02-05T12:25:02Z)
• Asymmetric Diffusion Based Channel-Adaptive Secure Wireless Semantic Communications [5.539381022630274]
  We propose a secure semantic communication system, DiffuSeC, which leverages the diffusion model and deep reinforcement learning (DRL) With the diffusing module in the sender end and the asymmetric denoising module in the receiver end, the DiffuSeC mitigates the perturbations added by semantic attacks. To further improve the robustness under unstable channel conditions caused by semantic attacks, we developed a DRL-based channel-adaptive diffusion step selection scheme.
  arXiv  Detail & Related papers  (2023-10-30T11:00:47Z)
• CONVERT:Contrastive Graph Clustering with Reliable Augmentation [110.46658439733106]
  We propose a novel CONtrastiVe Graph ClustEring network with Reliable AugmenTation (CONVERT) In our method, the data augmentations are processed by the proposed reversible perturb-recover network. To further guarantee the reliability of semantics, a novel semantic loss is presented to constrain the network.
  arXiv  Detail & Related papers  (2023-08-17T13:07:09Z)
• Over-the-Air Federated Learning with Privacy Protection via Correlated Additive Perturbations [57.20885629270732]
  We consider privacy aspects of wireless federated learning with Over-the-Air (OtA) transmission of gradient updates from multiple users/agents to an edge server. Traditional perturbation-based methods provide privacy protection while sacrificing the training accuracy. In this work, we aim at minimizing privacy leakage to the adversary and the degradation of model accuracy at the edge server.
  arXiv  Detail & Related papers  (2022-10-05T13:13:35Z)
• Robust Semantic Communications with Masked VQ-VAE Enabled Codebook [56.63571713657059]
  We propose a framework for the robust end-to-end semantic communication systems to combat the semantic noise. To combat the semantic noise, the adversarial training with weight is developed to incorporate the samples with semantic noise in the training dataset. We develop a feature importance module (FIM) to suppress the noise-related and task-unrelated features.
  arXiv  Detail & Related papers  (2022-06-08T16:58:47Z)
• Robust Semantic Communications Against Semantic Noise [34.80426719511182]
  We first propose a framework for the robust end-to-end semantic communication systems to combat semantic noise. We analyze the causes of semantic noise and propose a practical method to generate it. Our proposed method significantly improves the robustness of semantic communication systems against semantic noise with significant reduction on the transmission overhead.
  arXiv  Detail & Related papers  (2022-02-07T16:37:45Z)
• Reinforcement Learning-powered Semantic Communication via Semantic Similarity [13.569045590522316]
  We introduce a new semantic communication mechanism, whose key idea is to preserve the semantic information instead of strictly securing the bit-level precision. We show that the commonly used bit-level metrics are vulnerable of catching important semantic meaning and structures. We put forward a reinforcement learning (RL)-based solution which allows us to simultaneously optimize any user-defined semantic measurement.
  arXiv  Detail & Related papers  (2021-08-27T05:21:05Z)

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.