Capacity Formulas for the Lossy Bosonic Compound Wiretap Channel

• URL: http://arxiv.org/abs/2504.20870v1
• Date: Tue, 29 Apr 2025 15:43:18 GMT
• Title: Capacity Formulas for the Lossy Bosonic Compound Wiretap Channel
• Authors: Florian Seitz, Janis Nötzel,
• Abstract summary: A pair of lossy channels connects a sender with both a (legitimate) receiver and an eavesdropper.<n>The sender and receiver have only partial information about the actual state of the channels.<n>We prove capacity formulas for the case where both sender and receiver have the same information about the system.
• Score: 1.534667887016089
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We consider the bosonic compound wiretap channel. A pair of lossy channels connects a sender with both a (legitimate) receiver and an eavesdropper. The sender and receiver have only partial information about the actual state of the channels. In this situation, their task is to transmit the maximum amount of messages over an asymptotically large number of uses of their channel while guaranteeing at the same time that only an (asymptotically) negligible amount of information leaks to the eavesdropper. We prove capacity formulas for the case where both sender and receiver have the same information about the system and for the case where the sender has channel state information.

Related papers

• String commitment from unstructured noisy channels [53.04878543623513]
  Noisy channels are valuable resources for cryptography, enabling primitives like bit commitment and oblivious transfer.<n>We present a protocol for string commitment over such channels that is complete, hiding, and binding, and derive its achievable commitment rate.<n>The commitment rate coincides with previous results when the adversarial channels are the same binary symmetric channel as in the honest case.
  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)
• Age of Information in Deep Learning-Driven Task-Oriented Communications [78.84264189471936]
  This paper studies the notion of age in task-oriented communications that aims to execute a task at a receiver utilizing the data at its transmitter. The transmitter-receiver operations are modeled as an encoder-decoder pair of deep neural networks (DNNs) that are jointly trained.
  arXiv  Detail & Related papers  (2023-01-11T04:15:51Z)
• 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)
• Consensus Capacity of Noisy Broadcast Channels [8.228995613609118]
  Communication with consensus is possible only when the broadcast channel has embedded in it a natural ''common channel''<n>We show that communication with consensus is possible only when the broadcast channel has embedded in it a natural ''common channel''
  arXiv  Detail & Related papers  (2022-05-12T13:11:33Z)
• Identification Over Quantum Broadcast Channels [19.465727478912072]
  The decoder only identifies whether a message of his choosing was sent or not. An achievable identification region is derived for a quantum broadcast channel. Results are demonstrated for the quantum erasure broadcast channel, where our region is suboptimal, but improves on the best previously known bounds.
  arXiv  Detail & Related papers  (2022-01-26T17:00:03Z)
• Classical State Masking over a Quantum Channel [78.7611537027573]
  Transmission of classical information over a quantum state-dependent channel is considered, when the encoder can measure channel side information (CSI) and is required to mask information on the quantum channel state from the decoder. Regularized formula is derived for the masking equivocation region, and a full characterization is established for a class of measurement channels.
  arXiv  Detail & Related papers  (2021-09-26T16:29:27Z)
• Statistical intrusion detection and eavesdropping in quantum channels with coupling: Multiple-preparation and single-preparation methods [2.2469167925905777]
  Non-quantum communications include configurations with multiple-input multiple-output (MIMO) channels. Some associated signal processing tasks consider these channels in a symmetric way, i.e. by assigning the same role to all inputs. We here address asymmetric (blind and non-blind) ones, with emphasis on intrusion detection and additional comments about eavesdropping.
  arXiv  Detail & Related papers  (2021-06-17T07:04:54Z)
• Detecting positive quantum capacities of quantum channels [9.054540533394926]
  A noisy quantum channel can be used to reliably transmit quantum information at a non-zero rate. This is because it requires computation of the channel's coherent information for an unbounded number of copies of the channel. We show that a channel's ability to transmit information is intimately connected to the relative sizes of its input, output, and environment spaces.
  arXiv  Detail & Related papers  (2021-05-13T14:26:45Z)
• Quantum Broadcast Channels with Cooperating Decoders: An Information-Theoretic Perspective on Quantum Repeaters [78.7611537027573]
  Communication over a quantum broadcast channel with cooperation between the receivers is considered. We develop lower and upper bounds on the capacity region in each setting.
  arXiv  Detail & Related papers  (2020-11-18T11:58:48Z)
• Quantum Channel State Masking [78.7611537027573]
  Communication over a quantum channel that depends on a quantum state is considered when the encoder has channel side information (CSI) and is required to mask information on the quantum channel state from the decoder. A full characterization is established for the entanglement-assisted masking equivocation region, and a regularized formula is given for the quantum capacity-leakage function without assistance.
  arXiv  Detail & Related papers  (2020-06-10T16:18:03Z)

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.