Short Blocklength Wiretap Channel Codes via Deep Learning: Design and Performance Evaluation

• URL: http://arxiv.org/abs/2206.03477v1
• Date: Tue, 7 Jun 2022 17:52:46 GMT
• Title: Short Blocklength Wiretap Channel Codes via Deep Learning: Design and Performance Evaluation
• Authors: Vidhi Rana and Remi A. Chou
• Abstract summary: 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.
• Score: 5.203329540700176
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We design short blocklength codes for the Gaussian wiretap channel under information-theoretic security guarantees. Our approach consists in decoupling the reliability and secrecy constraints in our code design. Specifically, 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 and the leakage at the eavesdropper for our code construction. This leakage is defined as the mutual information between the confidential message and the eavesdropper's channel observations, and is empirically measured via a neural network-based mutual information estimator. Our simulation results provide examples of codes with positive secrecy rates that outperform the best known achievable secrecy rates obtained non-constructively for the Gaussian wiretap channel. Additionally, we show that our code design is suitable for the compound and arbitrarily varying Gaussian wiretap channels, for which the channel statistics are not perfectly known but only known to belong to a pre-specified uncertainty set. These models not only capture uncertainty related to channel statistics estimation, but also scenarios where the eavesdropper jams the legitimate transmission or influences its own channel statistics by changing its location.

Related papers

• Lazy Layers to Make Fine-Tuned Diffusion Models More Traceable [70.77600345240867]
  A novel arbitrary-in-arbitrary-out (AIAO) strategy makes watermarks resilient to fine-tuning-based removal. Unlike the existing methods of designing a backdoor for the input/output space of diffusion models, in our method, we propose to embed the backdoor into the feature space of sampled subpaths. Our empirical studies on the MS-COCO, AFHQ, LSUN, CUB-200, and DreamBooth datasets confirm the robustness of AIAO.
  arXiv  Detail & Related papers  (2024-05-01T12:03:39Z)
• An efficient combination of quantum error correction and authentication [1.1602089225841632]
  We study whether it can be done more efficiently by combining the two functionalities in a single code. We show that the threshold code needs polylogarithmically fewer qubits to achieve the same level of security and robustness.
  arXiv  Detail & Related papers  (2022-11-17T17:25:39Z)
• 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)
• Semantic Security with Infinite Dimensional Quantum Eavesdropping Channel [1.5070870469725095]
  We propose a new proof method for direct coding theorems for wiretap channels. The method yields errors that decay exponentially with increasing block lengths. It provides a guarantee of a quantum version of semantic security.
  arXiv  Detail & Related papers  (2022-05-16T13:25:56Z)
• CertainNet: Sampling-free Uncertainty Estimation for Object Detection [65.28989536741658]
  Estimating the uncertainty of a neural network plays a fundamental role in safety-critical settings. In this work, we propose a novel sampling-free uncertainty estimation method for object detection. We call it CertainNet, and it is the first to provide separate uncertainties for each output signal: objectness, class, location and size.
  arXiv  Detail & Related papers  (2021-10-04T17:59:31Z)
• Fault-tolerant parity readout on a shuttling-based trapped-ion quantum computer [64.47265213752996]
  We experimentally demonstrate a fault-tolerant weight-4 parity check measurement scheme. We achieve a flag-conditioned parity measurement single-shot fidelity of 93.2(2)%. The scheme is an essential building block in a broad class of stabilizer quantum error correction protocols.
  arXiv  Detail & Related papers  (2021-07-13T20:08:04Z)
• Composably secure data processing for Gaussian-modulated continuous variable quantum key distribution [58.720142291102135]
  Continuous-variable quantum key distribution (QKD) employs the quadratures of a bosonic mode to establish a secret key between two remote parties. We consider a protocol with homodyne detection in the general setting of composable finite-size security. In particular, we analyze the high signal-to-noise regime which requires the use of high-rate (non-binary) low-density parity check codes.
  arXiv  Detail & Related papers  (2021-03-30T18:02:55Z)
• Dual MINE-based Neural Secure Communications under Gaussian Wiretap Channel [19.295410015140735]
  We propose a dual mutual information neural estimation (MINE) based neural secure communications model. The security performance of our model is guaranteed whether the eavesdropper learns the decoder himself or uses the legal decoder.
  arXiv  Detail & Related papers  (2021-02-25T15:09:39Z)
• Channel Leakage, Information-Theoretic Limitations of Obfuscation, and Optimal Privacy Mask Design for Streaming Data [23.249999313567624]
  We first introduce the notion of channel leakage as the minimum mutual information between the channel input and channel output. In a broad sense, it can be viewed as a dual concept of channel capacity, which characterizes the maximum information transmission to the targeted receiver. We then utilize this notion to investigate the fundamental limitations of obfuscation in terms of privacy-distortion tradeoffs.
  arXiv  Detail & Related papers  (2020-08-11T17:55:47Z)
• DeepSIC: Deep Soft Interference Cancellation for Multiuser MIMO Detection [98.43451011898212]
  In multiuser multiple-input multiple-output (MIMO) setups, where multiple symbols are simultaneously transmitted, accurate symbol detection is challenging. We propose a data-driven implementation of the iterative soft interference cancellation (SIC) algorithm which we refer to as DeepSIC. DeepSIC learns to carry out joint detection from a limited set of training samples without requiring the channel to be linear.
  arXiv  Detail & Related papers  (2020-02-08T18:31:00Z)

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.