pith. sign in

arxiv: 1801.03656 · v2 · pith:5QXZS54Bnew · submitted 2018-01-11 · 💻 cs.IT · cs.CR· math.IT· quant-ph

Quantum Encryption and Generalized Quantum Shannon Impossibility

classification 💻 cs.IT cs.CRmath.ITquant-ph
keywords quantumsecrecyencryptionimperfectimpossibilityshannonanaloguecorrectness
0
0 comments X
read the original 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})$.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.