Quantum Encryption and Generalized Quantum Shannon Impossibility
arXiv:1801.03656 · doi:10.1007/s10623-018-00597-3
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 , where is the dimension of the encrypted quantum system. This is good enough if the target secrecy error is of .
arXiv comment10 pages. corrected a few errors in the previous version
References in corpus (8)
- The operational meaning of min- and max-entropy
- Randomizing quantum states: Constructions and applications
- Optimal Encryption of Quantum Bits
- Quantum homomorphic encryption from quantum codes
- Hiding Quantum Data
- Approximate Randomization of Quantum States With Fewer Bits of Key
- Quantum entropic security and approximate quantum encryption
- On the Optimality of Quantum Encryption Schemes