Classical-Quantum Arbitrarily Varying Wiretap Channel: Secret Message Transmission under Jamming Attacks
arXiv:1702.03483 · doi:10.1063/1.5005947
Abstract
We analyze arbitrarily varying classical-quantum wiretap channels.These channels are subject to two attacks at the same time: one passive (eavesdropping), and one active (jamming). We progress on previous works by introducing a reduced class of allowed codes that fulfills a more stringent secrecy requirement than earlier definitions. In addition, we prove that non-symmetrizability of the legal link is suficient for equality of the deterministic and the common randomness assisted secrecy capacities. At last, we focus on analytic properties of both secrecy capacities: We completely characterize their discontinuity points, and their super-activation properties.
arXiv commentarXiv admin note: text overlap with arXiv:1606.01768, arXiv:1307.8007
References in corpus (16)
- Quantum data processing and error correction
- Coding Theorem and Strong Converse for Quantum Channels
- A Sharp Fannes-type Inequality for the von Neumann Entropy
- Secure Multiplex Coding with Dependent and Non-Uniform Multiple Messages
- The Arbitrarily Varying Wiretap Channel - Secret Randomness, Stability and Super-Activation
- A channel under simultaneous jamming and eavesdropping attack---correlated random coding capacities under strong secrecy criteria
- Universal coding for classical-quantum channel
- Quantum capacity under adversarial quantum noise: arbitrarily varying quantum channels
- Quantum wiretap channel with non-uniform random number and its exponent and equivocation rate of leaked information
- Coding theorems for compound problems via quantum Rényi divergences
- Arbitrarily Small Amounts of Correlation for Arbitrarily Varying Quantum Channels
- Secrecy capacities of compound quantum wiretap channels and applications
- Classical-Quantum Arbitrarily Varying Wiretap Channel: Ahlswede dichotomy, Positivity, Resources, Super Activation
- Classical - Quantum Arbitrarily Varying Wiretap Channel: Common Randomness Assisted Code and Continuity
- Entanglement-assisted capacities of compound quantum channels
- Universal coding for transmission of private information
Cited by in corpus (3)
- Secure and Robust Identification via Classical-Quantum Channels
- Message Transmission over Classical Quantum Channels with a Jammer with Side Information: Correlation as Resource, Common Randomness Generation
- Quantum Key Distribution: Bridging Theoretical Security Proofs, Practical Attacks, and Error Correction for Quantum-Augmented Networks