Covert Entanglement Generation and Secrecy

• URL: http://arxiv.org/abs/2503.21002v1
• Date: Wed, 26 Mar 2025 21:34:18 GMT
• Title: Covert Entanglement Generation and Secrecy
• Authors: Ohad Kimelfeld, Boulat A. Bash, Uzi Pereg,
• Abstract summary: We determine the covert capacity for entanglement generation over a noisy quantum channel.<n>While secrecy guarantees that the transmitted information remains inaccessible to an adversary, covert communication ensures that the transmission itself remains undetectable.<n>We establish achievability of the same covert entanglement generation rate as the classical information rate without secrecy, albeit with a larger key.
• Score: 15.894241142512053
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We determine the covert capacity for entanglement generation over a noisy quantum channel. While secrecy guarantees that the transmitted information remains inaccessible to an adversary, covert communication ensures that the transmission itself remains undetectable. The entanglement dimension follows a square root law (SRL) in the covert setting, i.e., $O(\sqrt{n})$ EPR pairs can be distributed covertly and reliably over n channel uses. We begin with covert communication of classical information under a secrecy constraint. We then leverage this result to construct a coding scheme for covert entanglement generation. Consequently, we establish achievability of the same covert entanglement generation rate as the classical information rate without secrecy, albeit with a larger key.

Related papers

• Achievability of Covert Quantum Communication [2.2474167740753557]
  We show the achievability of a $textitsquare root law$ (SRL) for quantum covert communication similar to that for classical. We lower bound $M(n)$ with and without assistance from a two-way covert classical channel.
  arXiv  Detail & Related papers  (2025-01-22T18:59:08Z)
• Coding-Based Hybrid Post-Quantum Cryptosystem for Non-Uniform Information [53.85237314348328]
  We introduce for non-uniform messages a novel hybrid universal network coding cryptosystem (NU-HUNCC) We show that NU-HUNCC is information-theoretic individually secured against an eavesdropper with access to any subset of the links.
  arXiv  Detail & Related papers  (2024-02-13T12:12:39Z)
• Non-Adaptive Coding for Two-Way Wiretap Channel with or without Cost Constraints [45.65636963872864]
  We study the secrecy results for the two-way wiretap channel (TW-WC) with an external eavesdropper under a strong secrecy metric. We derive inner bounds on the secrecy capacity regions for the TW-WC under strong joint and individual secrecy constraints.
  arXiv  Detail & Related papers  (2023-10-21T01:05:59Z)
• 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)
• 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)
• 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)
• Semantic Security with Infinite Dimensional Quantum Eavesdropping Channel [1.5070870469725095]
  We propose a new proof method for direct coding theorems for wiretap channels.<n>The method yields errors that decay exponentially with increasing block lengths.<n>It provides a guarantee of a quantum version of semantic security.
  arXiv  Detail & Related papers  (2022-05-16T13:25:56Z)
• Privacy Amplification via Shuffling for Linear Contextual Bandits [51.94904361874446]
  We study the contextual linear bandit problem with differential privacy (DP) We show that it is possible to achieve a privacy/utility trade-off between JDP and LDP by leveraging the shuffle model of privacy. Our result shows that it is possible to obtain a tradeoff between JDP and LDP by leveraging the shuffle model while preserving local privacy.
  arXiv  Detail & Related papers  (2021-12-11T15:23:28Z)
• 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.