Semantic Security for Quantum Wiretap Channels
arXiv:2001.05719 · doi:10.1063/5.0086634
Abstract
We consider the problem of semantic security via classical-quantum and quantum wiretap channels and use explicit constructions to transform a non-secure code into a semantically secure code, achieving capacity by means of biregular irreducible functions. Explicit parameters in finite regimes can be extracted from theorems. We also generalize the semantic security capacity theorem, which shows that a strongly secure code guarantees a semantically secure code with the same secrecy rate, to any quantum channel, including the infinite-dimensional and non-Gaussian ones.
v2: published version; v1: 38 pages, 2 figures
References in corpus (7)
- Quantum cryptography: Public key distribution and coin tossing
- Coding Theorem and Strong Converse for Quantum Channels
- A Sharp Fannes-type Inequality for the von Neumann Entropy
- Upper bounds of eavesdropper's performances in finite-length code with decoy method
- Generalized relative entropies and the capacity of classical-quantum channels
- Mosaics of combinatorial designs for information-theoretic security
- Privacy of a lossy bosonic memory channel