IEEE International Symposium on Information Theory (ISIT)

Semantic Security for Quantum Wiretap Channels

Holger Boche, Minglai Cai, Moritz Wiese, Christian Deppe, Roberto Ferrara

Published Jun 1, 2020• 3 citations

Abstract

We determine the semantic security capacity for quantum wiretap channels. We extend methods for classical channels to quantum channels to demonstrate that a strongly secure code guarantees a semantically secure code with the same secrecy rate. Furthermore, we show how to transform a non-secure code into a semantically secure code by means of biregular irreducible functions (BRI functions). We analyze semantic security for classical-quantum channels and for quantum channels.

DOI: 10.1109/isit44484.2020.9174418

Related papers

Semantic security for quantum wiretap channels

Holger Boche, Minglai Cai, Christian Deppe +2 more

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.

arXiv:2001.05719Journal of Mathematical PhysicsSep 1, 20229 citations

Mosaics of Combinatorial Designs for Semantic Security on Quantum Wiretap Channels

Holger Boche, Minglai Cai, Moritz Wiese

We study semantic security for classical-quantum channels. Our security functions are functional forms of mosaics of combinatorial designs. We extend methods in [25] from classical channels to classical-quantum channels to demonstrate that mosaics of designs ensure semantic security for classical-quantum channels, and are also capacity achieving coding schemes. An advantage of these modular wiretap codes is that we provide explicit code constructions that can be implemented in practice for every channel, given an arbitrary public code.

arXiv:2202.05314IEEE International Symposium on Information Theory (ISIT)Jun 26, 20224 citations

Semantic Security with Infinite Dimensional Quantum Eavesdropping Channel

Matthias Frey, Igor Bjelaković, Janis Nötzel +1 more

We propose a new proof method for direct coding theorems for wiretap channels where the eavesdropper has access to a quantum version of the transmitted signal on an infinite dimensional Hilbert space. This method yields errors that decay exponentially with increasing block lengths. Moreover, it provides a guarantee of a quantum version of semantic security, which is an established concept in classical cryptography and physical layer security. Semantic security has strong operational implications meaning essentially that the eavesdropper cannot use its quantum observation to gather any meaningful information about the transmitted signal. Therefore, it complements existing works which either do not prove the exponential error decay or use weaker notions of security. The main part of this proof method is a direct coding result on channel resolvability which states that there is only a doubly exponentially small probability that a standard random codebook does not solve the channel resolvability problem for the classical-quantum channel.

IEEE Information Theory Workshop (ITW)Nov 1, 20223 citations

Semantic Security With Infinite-Dimensional Quantum Eavesdropping Channel

Matthias Frey, Igor Bjelaković, Janis Nötzel +1 more

We propose a new proof method for direct coding theorems for wiretap channels where the eavesdropper has access to a quantum version of the transmitted signal on an infinite-dimensional Hilbert space and the legitimate parties communicate through a classical channel or a classical input, quantum output (cq) channel. The transmitter input can be subject to an additive cost constraint, which specializes to the case of an average energy constraint. This method yields errors that decay exponentially with increasing block lengths. Moreover, it provides a guarantee of a quantum version of semantic security, which is an established concept in classical cryptography and physical layer security. Therefore, it complements existing works which either do not prove the exponential error decay or use weaker notions of security. The main part of this proof method is a direct coding result on channel resolvability which states that there is only a doubly exponentially small probability that a standard random codebook does not solve the channel resolvability problem for the cq channel. Semantic security has strong operational implications meaning essentially that the eavesdropper cannot use its quantum observation to gather any meaningful information about the transmitted signal. We also discuss the connections between semantic security and various other established notions of secrecy.

arXiv:2205.07663IEEE Transactions on Information TheoryJan 17, 20254 citations

Semantic Security for the Fast Fading Wiretap Channel.

Parker Pavlicek

We provide a set of semantically secure achievable rates for the fast fading wiretap channel. In particular, we do so for the cases where there is channel state information at the transmitter (CSIT) for both the main and eavesdropper channels (full CSIT), for only the main channel (partial CSIT), and for neither channel (statistical CSIT). In the case of partial CSIT and statistical CSIT fast-fading channels, we show that this coding scheme can achieve the best known achievable rates. In the case of full CSIT fast-fading wiretap channels, we show that this coding scheme can actually achieve the secrecy capacity. In particular, this implies that the semantic secrecy capacity for these channels is equivalent to the weak and strong secrecy capacities. Moreover, we achieve these rates in a way that is non-invasive to existing systems and also happens to be explicitly given as well as efficient in implementation.

Jan 1, 20181 citation

Classical-Quantum Arbitrarily Varying Wiretap Channel: Common Randomness Assisted Code and Continuity

Holger Boche, Minglai Cai, Christian Deppe +1 more

We determine the secrecy capacities under common randomness assisted coding of arbitrarily varying classical-quantum wiretap channels. Furthermore, we determine the secrecy capacity of a mixed channel model which is compound from the sender to the legitimate receiver and varies arbitrarily from the sender to the eavesdropper. We examine when the secrecy capacity is a continuous function of the system parameters as an application and show that resources, e.g., having access to a perfect copy of the outcome of a random experiment, can guarantee continuity of the capacity function of arbitrarily varying classical-quantum wiretap channels.

Jan 1, 201615 citations