Feedback Lunch: Deep Feedback Codes for Wiretap Channels

• URL: http://arxiv.org/abs/2510.16620v2
• Date: Thu, 23 Oct 2025 04:34:55 GMT
• Title: Feedback Lunch: Deep Feedback Codes for Wiretap Channels
• Authors: Yingyao Zhou, Natasha Devroye, Onur Günlü,
• Abstract summary: This work focuses on a seeded modular code design for the Gaussian wiretap channel with channel output feedback.<n>We study the trade-off between communication reliability and information leakage, illustrating that feedback enables agreeing on a secret key shared between legitimate parties.
• Score: 6.688325803107936
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We consider reversely-degraded wiretap channels, for which the secrecy capacity is zero if there is no channel feedback. This work focuses on a seeded modular code design for the Gaussian wiretap channel with channel output feedback, combining universal hash functions for security and learned feedback-based codes for reliability to achieve positive secrecy rates. We study the trade-off between communication reliability and information leakage, illustrating that feedback enables agreeing on a secret key shared between legitimate parties, overcoming the security advantage of the wiretapper. Our findings also motivate code designs for sensing-assisted secure communication, to be used in next-generation integrated sensing and communication methods.

Related papers

• 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 With Homomorphic Encryption [52.5344514499035]
  This paper explores the feasibility of applying homomorphic encryption to SemCom.<n>We propose a task-oriented SemCom scheme secured through homomorphic encryption.
  arXiv  Detail & Related papers  (2025-01-17T13:26:14Z)
• String commitment from unstructured noise [46.40786209841718]
  We introduce the unstructured noisy channel model as a generalization of the unfair noisy channel model.<n>We show that the entropic constraints in the unstructured noisy channel model can be derived from physical assumptions such as noisy quantum storage.
  arXiv  Detail & Related papers  (2024-12-31T05:28:05Z)
• Secure Integrated Sensing and Communication Under Correlated Rayleigh Fading [35.096935840816684]
  We consider a secure integrated sensing and communication (ISAC) scenario, in which a signal is transmitted through a state-dependent wiretap channel. We establish and illustrate an achievable secrecy-distortion region for degraded secure ISAC channels under correlated Rayleigh fading.
  arXiv  Detail & Related papers  (2024-08-30T07:16:55Z)
• Transmitter Actions for Secure Integrated Sensing and Communication [23.322477552758237]
  This work models a secure integrated sensing and communication (ISAC) system as a wiretap channel with action-dependent channel states and channel output feedback. The transmitted message is split into a common and a secure message, both of which must be reliably recovered at the legitimate receiver. The secure message needs to be kept secret from the eavesdropper.
  arXiv  Detail & Related papers  (2024-08-24T17:37:23Z)
• Security for adversarial wiretap channels [4.383205675898942]
  We analyze information-theoretically secure coding schemes which use the inverse of an extractor and an error-correcting code. We show that this also holds for certain channel types with memory.
  arXiv  Detail & Related papers  (2024-04-02T09:22:40Z)
• Joint Sensing and Semantic Communications with Multi-Task Deep Learning [45.622060532244944]
  This paper explores the integration of deep learning techniques for joint sensing and communications, with an extension to semantic communications. The integrated system comprises a transmitter and receiver operating over a wireless channel, subject to noise and fading. The transmitter employs a deep neural network (DNN), namely an encoder, for joint operations of source coding, channel coding, and modulation. The receiver utilizes another DNN, namely a decoder, for joint operations of demodulation, channel decoding, and source decoding to reconstruct the data samples.
  arXiv  Detail & Related papers  (2023-11-08T21:03:43Z)
• Fault-tolerant Coding for Entanglement-Assisted Communication [46.0607942851373]
  This paper studies the study of fault-tolerant channel coding for quantum channels. We use techniques from fault-tolerant quantum computing to establish coding theorems for sending classical and quantum information in this scenario. We extend these methods to the case of entanglement-assisted communication, in particular proving that the fault-tolerant capacity approaches the usual capacity when the gate error approaches zero.
  arXiv  Detail & Related papers  (2022-10-06T14:09:16Z)
• Short Blocklength Wiretap Channel Codes via Deep Learning: Design and Performance Evaluation [5.203329540700176]
  We design short blocklength codes for the Gaussian wiretap channel under information-theoretic security guarantees. We handle the reliability constraint via an autoencoder, and handle the secrecy constraint with hash functions. For blocklengths smaller than or equal to 16, we evaluate through simulations the probability of error at the legitimate receiver.
  arXiv  Detail & Related papers  (2022-06-07T17:52:46Z)
• Secure and Private Source Coding with Private Key and Decoder Side Information [139.515333493829]
  The problem of secure source coding with multiple terminals is extended by considering a remote source whose noisy measurements are correlated random variables. The main additions to the problem include 1) all terminals noncausally observe a noisy measurement of the remote source; 2) a private key is available to all legitimate terminals; 3) the public communication link between the encoder and decoder is rate-limited; 4) the secrecy leakage to the eavesdropper is measured with respect to the encoder input, whereas the privacy leakage is measured with respect to the remote source.
  arXiv  Detail & Related papers  (2022-05-10T17:51:28Z)
• CAnet: Uplink-aided Downlink Channel Acquisition in FDD Massive MIMO using Deep Learning [51.72869237847767]
  In frequency-division duplexing systems, the downlink channel state information (CSI) acquisition scheme leads to high training and feedback overheads. We propose an uplink-aided downlink channel acquisition framework using deep learning to reduce these overheads.
  arXiv  Detail & Related papers  (2021-01-12T10:12:28Z)
• FedRec: Federated Learning of Universal Receivers over Fading Channels [92.15358738530037]
  We propose a neural network-based symbol detection technique for downlink fading channels. Multiple users collaborate to jointly learn a universal data-driven detector, hence the name FedRec. The performance of the resulting receiver is shown to approach the MAP performance in diverse channel conditions without requiring knowledge of the fading statistics.
  arXiv  Detail & Related papers  (2020-11-14T11:29:55Z)
• Learning End-to-End Codes for the BPSK-constrained Gaussian Wiretap Channel [1.9036571490366496]
  The goal is to find codes which allow a pair of transmitter and receiver to communicate reliably and securely in the presence of an adversary. The security is evaluated in terms of mutual information utilizing a deep learning tool called MINE. Numerical results demonstrate that the legitimate parties can indeed establish a secure transmission in this setting.
  arXiv  Detail & Related papers  (2020-03-23T23:26:36Z)
• Semantic Security for Quantum Wiretap Channels [68.24747267214373]
  We consider the problem of semantic security via classical-quantum and quantum wiretap channels. We use explicit constructions to transform a non-secure code into a semantically secure code, achieving capacity by means of biregular irreducible functions.
  arXiv  Detail & Related papers  (2020-01-16T09:55:49Z)

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.