Quantum Encryption and Generalized Quantum Shannon Impossibility

January 11, 2018 Β· Declared Dead Β· πŸ› Designs, Codes and Cryptography

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Ching-Yi Lai, Kai-Min Chung arXiv ID 1801.03656 Category cs.IT: Information Theory Cross-listed cs.CR, quant-ph Citations 11 Venue Designs, Codes and Cryptography Last Checked 4 months ago
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})$.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Information Theory

Died the same way β€” πŸ‘» Ghosted