Generalized Quantum Shannon Impossibility for Quantum Encryption

01/11/2018
by   Ching-Yi Lai, et al.
0

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 prove its quantum analogue with imperfect secrecy and imperfect correctness. We also provide a systematic study of information-theoretically secure quantum encryption with two secrecy definitions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/14/2018

Block encryption of quantum messages

In modern cryptography, block encryption is a fundamental cryptographic ...
research
03/11/2023

Approaching Shannon's One-Time Pad: Metrics, Architectures, and Enabling Technologies

The rapid development of advanced computing technologies such as quantum...
research
01/15/2020

Network Information Theoretic Security

Shannon showed that to achieve perfect secrecy in point-to-point communi...
research
01/16/2019

A wireless secure key distribution system with no couriers: a One-Time-Pad Revival

Among the problems to guarantee secrecy for in-transit information, the ...
research
10/24/2018

Entropy in Quantum Information Theory -- Communication and Cryptography

In this Thesis, several results in quantum information theory are collec...
research
02/15/2023

Shannon Perfect Secrecy in a Discrete Hilbert Space

The One-time-pad (OTP) was mathematically proven to be perfectly secure ...
research
10/08/2018

Fully Homomorphic Image Processing

Fully homomorphic encryption has allowed devices to outsource computatio...

Please sign up or login with your details

Forgot password? Click here to reset