Cryptographic and Information-theoretic Security Capacities for General Arbitrarily Varying Wiretap Channels

• URL: http://arxiv.org/abs/2605.06751v2
• Date: Mon, 11 May 2026 09:14:23 GMT
• Title: Cryptographic and Information-theoretic Security Capacities for General Arbitrarily Varying Wiretap Channels
• Abstract summary: We show that the average error and strong secrecy capacity of an AVWC is always equal to its maximal error and semantic secrecy capacity.<n>We also show that, for the GAVWC, semantic security and the other cryptographic security measures considered achieve the same capacity values.
• Score: 34.655736618618626
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We compare the strong secrecy capacities of Arbitrarily Varying Wiretap Channels (AVWCs) and General Arbitrarily Varying Wiretap Channels (GAVWCs) with their capacities under semantic secrecy constraint and other equivalent cryptographic secrecy constraints. It turns out that the average error and strong secrecy capacity of an AVWC is always equal to its maximal error and semantic secrecy capacity. However, this equivalence does not hold for all general communication systems, and we prove this by a counterexample. We also show that, for the GAVWC, semantic security and the other cryptographic security measures considered achieve the same capacity values. Finally, we bound the gap between the strong secrecy capacity and the semantic secrecy capacity for the GAVWC. The gap vanishes if the choice of the jammer is sub-double-exponential with respect to the block length n, which gives a sufficient condition for the strong and semantic secrecy capacities to be equal for GAVWCs.

Related papers

• Quantum Advantage in Multiple Access Wiretap Channels with Entangled Transmitters [11.619051850120044]
  We investigate secure communication over a classical multiple-access wiretap channel (MAC-WTC)<n>Under the strict semantic security criterion, we derive an achievable rate region and a regularized expression for the secrecy capacity.<n>Our results demonstrate that entanglement strictly enlarges the secrecy capacity of MAC-WTC compared to sharing only classical correlated randomness.
  arXiv  Detail & Related papers  (2026-09-06T19:58:13Z)
• Covert Entanglement Generation and Secrecy [15.40303080342273]
  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.
  arXiv  Detail & Related papers  (2025-03-26T21:34:18Z)
• 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)
• Semantic Entropy Can Simultaneously Benefit Transmission Efficiency and Channel Security of Wireless Semantic Communications [55.54210451136529]
  We propose SemEntropy to explore semantics of data for both adaptive transmission and physical layer encryption.<n>We show that SemEntropy can keep the semantic accuracy remain 95% with 60% less transmission.
  arXiv  Detail & Related papers  (2024-02-05T12:25:02Z)
• 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)
• 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)
• Quantum Proofs of Deletion for Learning with Errors [91.3755431537592]
  We construct the first fully homomorphic encryption scheme with certified deletion. Our main technical ingredient is an interactive protocol by which a quantum prover can convince a classical verifier that a sample from the Learning with Errors distribution in the form of a quantum state was deleted.
  arXiv  Detail & Related papers  (2022-03-03T10:07:32Z)
• 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)
• Permutation Enhances Classical Communication Assisted by Entangled States [67.12391801199688]
  We show that the capacity satisfies the strong converse property and thus the formula serves as a sharp dividing line between achievable and unachievable rates of communication. As examples, we derive analytically the classical capacity of various quantum channels of interests.
  arXiv  Detail & Related papers  (2020-01-07T01:49:31Z)

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.