Quantum Encryption and Generalized Quantum Shannon Impossibility

Abstract

The famous Shannon impossibility result says that any encryption scheme with perfect secrecy requires a secret key at least as long as the message. In this paper we provide its quantum analogue with imperfect secrecy and imperfect correctness. We also give a systematic study of information-theoretically secure quantum encryption with two secrecy definitions. We show that the weaker one implies the stronger but with a security loss in $d$, where $d$ is the dimension of the encrypted quantum system. This is good enough if the target secrecy error is of $o(d^{-1})$.

10 pages. corrected a few errors in the previous version

References in corpus (2)

• Randomizing quantum states: Constructions and applications
• Hiding Quantum Data

Cited by in corpus (3)

• Homomorphic encryption of linear optics quantum computation on almost arbitrary states of light with asymptotically perfect security
• Error correctable efficient quantum homomorphic encryption using Calderbank-Shor-Steane codes
• A quantum homomorphic encryption scheme for polynomial-sized circuits