Privacy-Aware Joint Source-Channel Coding for image transmission based on Disentangled Information Bottleneck

• URL: http://arxiv.org/abs/2309.08188v1
• Date: Fri, 15 Sep 2023 06:34:22 GMT
• Title: Privacy-Aware Joint Source-Channel Coding for image transmission based on Disentangled Information Bottleneck
• Authors: Lunan Sun, Caili Guo, Mingzhe Chen, Yang Yang,
• Abstract summary: Current privacy-aware joint source-channel coding (JSCC) works aim at avoiding private information transmission by adversarially training the J SCC encoder and decoder. We propose a novel privacy-aware J SCC based on disentangled information bottleneck (DIB-PAJSCC) We show that DIB-PAJSCC can reduce the eavesdropping accuracy on private information by up to 20% compared to existing methods.
• Score: 27.929075969353764
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Current privacy-aware joint source-channel coding (JSCC) works aim at avoiding private information transmission by adversarially training the JSCC encoder and decoder under specific signal-to-noise ratios (SNRs) of eavesdroppers. However, these approaches incur additional computational and storage requirements as multiple neural networks must be trained for various eavesdroppers' SNRs to determine the transmitted information. To overcome this challenge, we propose a novel privacy-aware JSCC for image transmission based on disentangled information bottleneck (DIB-PAJSCC). In particular, we derive a novel disentangled information bottleneck objective to disentangle private and public information. Given the separate information, the transmitter can transmit only public information to the receiver while minimizing reconstruction distortion. Since DIB-PAJSCC transmits only public information regardless of the eavesdroppers' SNRs, it can eliminate additional training adapted to eavesdroppers' SNRs. Experimental results show that DIB-PAJSCC can reduce the eavesdropping accuracy on private information by up to 20\% compared to existing methods.

Related papers

• Conditional Denoising Diffusion Probabilistic Models for Data Reconstruction Enhancement in Wireless Communications [12.218161437914118]
  conditional denoising diffusion probabilistic models (DDPMs) are proposed to enhance the data transmission and reconstruction over wireless channels. Inspired by this, the key idea is to leverage the generative prior of diffusion models in learning a "noisy-to-clean" transformation of the information signal. The proposed scheme could be beneficial for communication scenarios in which a prior knowledge of the information content is available.
  arXiv  Detail & Related papers  (2023-10-30T11:33:01Z)
• Semantics Alignment via Split Learning for Resilient Multi-User Semantic Communication [56.54422521327698]
  Recent studies on semantic communication rely on neural network (NN) based transceivers such as deep joint source and channel coding (DeepJSCC) Unlike traditional transceivers, these neural transceivers are trainable using actual source data and channels, enabling them to extract and communicate semantics. We propose a distributed learning based solution, which leverages split learning (SL) and partial NN fine-tuning techniques.
  arXiv  Detail & Related papers  (2023-10-13T20:29:55Z)
• Disentangled Information Bottleneck guided Privacy-Protective JSCC for Image Transmission [27.929075969353764]
  Joint source and channel coding (JSCC) has attracted increasing attention due to its robustness and high efficiency. In this paper, we propose a privacy-protective JSCC (DIB-PPJSCC) for image transmission. We employ a private information encryptor to encrypt the private subcodewords before transmission, and a corresponding decryptor to recover the private information at the legitimate receiver.
  arXiv  Detail & Related papers  (2023-09-19T02:37:53Z)
• Secure Deep-JSCC Against Multiple Eavesdroppers [13.422085141752468]
  We propose an end-to-end (E2E) learning-based approach for secure communication against multiple eavesdroppers. We implement deep neural networks (DNNs) to realize a data-driven secure communication scheme. Our experiments show that employing the proposed secure neural encoding can decrease the adversarial accuracy by 28%.
  arXiv  Detail & Related papers  (2023-08-05T14:40:35Z)
• Breaking the Communication-Privacy-Accuracy Tradeoff with $f$-Differential Privacy [51.11280118806893]
  We consider a federated data analytics problem in which a server coordinates the collaborative data analysis of multiple users with privacy concerns and limited communication capability. We study the local differential privacy guarantees of discrete-valued mechanisms with finite output space through the lens of $f$-differential privacy (DP) More specifically, we advance the existing literature by deriving tight $f$-DP guarantees for a variety of discrete-valued mechanisms.
  arXiv  Detail & Related papers  (2023-02-19T16:58:53Z)
• 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)
• Adaptive Information Bottleneck Guided Joint Source and Channel Coding for Image Transmission [132.72277692192878]
  An adaptive information bottleneck (IB) guided joint source and channel coding (AIB-JSCC) is proposed for image transmission. The goal of AIB-JSCC is to reduce the transmission rate while improving the image reconstruction quality. Experimental results show that AIB-JSCC can significantly reduce the required amount of transmitted data and improve the reconstruction quality.
  arXiv  Detail & Related papers  (2022-03-12T17:44:02Z)
• DP-REC: Private & Communication-Efficient Federated Learning [16.884416092951007]
  We introduce a compression technique based on Relative Entropy Coding (REC) to the federated setting. With a minor modification to REC, we obtain a provably differentially private learning algorithm, DP-REC, and show how to compute its privacy guarantees. Our experiments demonstrate that DP-REC drastically reduces communication costs while providing privacy guarantees comparable to the state-of-the-art.
  arXiv  Detail & Related papers  (2021-11-09T23:33:11Z)
• Privacy-Aware Communication Over the Wiretap Channel with Generative Networks [34.6578234382717]
  We study privacy-aware communication over a wiretap channel using end-to-end learning. We propose a data-driven approach using variational autoencoder (VAE)-based joint source channel coding (JSCC)
  arXiv  Detail & Related papers  (2021-10-08T12:47:24Z)
• Graph-Homomorphic Perturbations for Private Decentralized Learning [64.26238893241322]
  Local exchange of estimates allows inference of data based on private data. perturbations chosen independently at every agent, resulting in a significant performance loss. We propose an alternative scheme, which constructs perturbations according to a particular nullspace condition, allowing them to be invisible.
  arXiv  Detail & Related papers  (2020-10-23T10:35:35Z)
• RDP-GAN: A R\'enyi-Differential Privacy based Generative Adversarial Network [75.81653258081435]
  Generative adversarial network (GAN) has attracted increasing attention recently owing to its impressive ability to generate realistic samples with high privacy protection. However, when GANs are applied on sensitive or private training examples, such as medical or financial records, it is still probable to divulge individuals' sensitive and private information. We propose a R'enyi-differentially private-GAN (RDP-GAN), which achieves differential privacy (DP) in a GAN by carefully adding random noises on the value of the loss function during training.
  arXiv  Detail & Related papers  (2020-07-04T09:51:02Z)

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.