DeepAI AI Chat
Log In Sign Up

Semantic Security with Infinite Dimensional Quantum Eavesdropping Channel

by   Matthias Frey, et al.

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.


page 1

page 2

page 3

page 4


Mosaics of Combinatorial Designs for Semantic Security on Quantum Wiretap Channels

We study semantic security for classical-quantum channels. Our security ...

Ultimate Limits of Quantum Channel Discrimination

This paper studies the difficulty of discriminating quantum channels und...

Equivalence of three quantum algorithms: Privacy amplification, error correction, and data compression

Privacy amplification (PA) is an indispensable component in classical an...

Strong Converse for Classical-Quantum Degraded Broadcast Channels

We consider the transmission of classical information through a degraded...

Self-restricting Noise and Quantum Relative Entropy Decay

Open quantum systems as modeled by quantum channels and quantum Markov s...

Quantum Logspace Computations are Verifiable

In this note, we observe that quantum logspace computations are verifiab...