Key Assistance, Key Agreement, and Layered Secrecy for Bosonic Broadcast Channels

• URL: http://arxiv.org/abs/2105.04033v2
• Date: Mon, 13 Sep 2021 21:29:57 GMT
• Title: Key Assistance, Key Agreement, and Layered Secrecy for Bosonic Broadcast Channels
• Authors: Uzi Pereg, Roberto Ferrara, and Matthieu R. Bloch
• Abstract summary: Secret-sharing building blocks based on quantum broadcast communication are studied. The confidential capacity region of the pure-loss bosonic broadcast channel is determined. We derive an achievable layered-secrecy region for a pure-loss bosonic channel formed by the concatenation of two beam splitters.
• Score: 37.90858441567178
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Secret-sharing building blocks based on quantum broadcast communication are studied. The confidential capacity region of the pure-loss bosonic broadcast channel is determined, both with and without key assistance, and an achievable region is established for the lossy bosonic broadcast channel. If the main receiver has a transmissivity of \eta<1/2, then confidentiality solely relies on the key-assisted encryption of the one-time pad. We also address conference key agreement for the distillation of two keys, a public key and a secret key. A regularized formula is derived for the key-agreement capacity region in finite dimensions. In the bosonic case, the key-agreement region is included within the capacity region of the corresponding broadcast channel with confidential messages. We then consider a network with layered secrecy, where three users with different security ranks communicate over the same broadcast network. We derive an achievable layered-secrecy region for a pure-loss bosonic channel that is formed by the concatenation of two beam splitters.

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. We present a protocol for string commitment over such channels that is complete, hiding, and binding, and derive its achievable commitment rate. 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)
• Private Communication over a Bosonic Compound Channel [7.849709311008473]
  We prove a capacity formula for the bosonic compound wiretap channel using the binary phase shift keying alphabet. We are able to quantify in this work exactly how channel uncertainty penalizes data transmission rates.
  arXiv  Detail & Related papers  (2024-11-15T15:49:33Z)
• Extendibility limits quantum-secured communication and key distillation [4.079147243688764]
  We study the task of secret-key distillation from bipartite states and point-to-point quantum channels. We extend our formalism to private communication over a quantum channel assisted by forward classical communication.
  arXiv  Detail & Related papers  (2024-10-28T18:00:11Z)
• Eavesdropper localization for quantum and classical channels via nonlinear scattering [58.720142291102135]
  Quantum key distribution (QKD) offers theoretical security based on the laws of physics. We present a novel approach to eavesdropper location that can be employed in quantum as well as classical channels. We demonstrate that our approach outperforms conventional OTDR in the task of localizing an evanescent outcoupling of 1% with cm precision inside standard optical fibers.
  arXiv  Detail & Related papers  (2023-06-25T21:06:27Z)
• Establishing shared secret keys on quantum line networks: protocol and security [0.0]
  We show the security of multi-user key establishment on a single line of quantum communication. We consider a quantum communication architecture where qubit generation and measurement happen at the two ends of the line.
  arXiv  Detail & Related papers  (2023-04-04T15:35:23Z)
• Revocable Cryptography from Learning with Errors [61.470151825577034]
  We build on the no-cloning principle of quantum mechanics and design cryptographic schemes with key-revocation capabilities. We consider schemes where secret keys are represented as quantum states with the guarantee that, once the secret key is successfully revoked from a user, they no longer have the ability to perform the same functionality as before.
  arXiv  Detail & Related papers  (2023-02-28T18:58:11Z)
• 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)
• 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)
• 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)
• Single-Shot Secure Quantum Network Coding for General Multiple Unicast Network with Free One-Way Public Communication [56.678354403278206]
  We propose a canonical method to derive a secure quantum network code over a multiple unicast quantum network. Our code correctly transmits quantum states when there is no attack. It also guarantees the secrecy of the transmitted quantum state even with the existence of an attack.
  arXiv  Detail & Related papers  (2020-03-30T09:25:13Z)
• Backflash Light as a Security Vulnerability in Quantum Key Distribution Systems [77.34726150561087]
  We review the security vulnerabilities of quantum key distribution (QKD) systems. We mainly focus on a particular effect known as backflash light, which can be a source of eavesdropping attacks.
  arXiv  Detail & Related papers  (2020-03-23T18:23:12Z)

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.