“We revisit the quantum one-time pad and investigate the possibility of shortening the key used for quantum encryption. We first provide an impossibility result, and then show how it can be circumvented in two different ways: using approximate encryption, and by opening the door to the fascinating world of computational security. We also discuss a new possibility for quantum encryption, which is known as certified deletion: this is the possibility for the encrypter of a secret to request that the ciphertext is provably and irrevocably erased.”
Review the options below to login to check your access.
Log in with your Cambridge Aspire website account to check access.
If you believe you should have access to this content, please contact your institutional librarian or consult our FAQ page for further information about accessing our content.