Uncloneable Encryption, Revisited

03/27/2021
by   Prabhanjan Ananth, et al.
0

Uncloneable encryption, introduced by Broadbent and Lord (TQC'20), is an encryption scheme with the following attractive feature: an adversary cannot create multiple ciphertexts which encrypt to the same message as the original ciphertext. The constructions proposed by Broadbent and Lord have the disadvantage that they only guarantee one-time security; that is, the encryption key can only be used once to encrypt the message. In this work, we study uncloneable encryption schemes, where the encryption key can be re-used to encrypt multiple messages. We present two constructions from minimal cryptographic assumptions: (i) a private-key uncloneable encryption scheme assuming post-quantum one-way functions and, (ii) a public-key uncloneable encryption scheme assuming a post-quantum public-key encryption scheme.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/12/2021

Quantum Encryption with Certified Deletion, Revisited: Public Key, Attribute-Based, and Classical Communication

Broadbent and Islam (TCC '20) proposed a quantum cryptographic primitive...
research
02/28/2023

Revocable Cryptography from Learning with Errors

Quantum cryptography leverages many unique features of quantum informati...
research
03/01/2020

Make Quantum Indistinguishability Great Again

In this work we study the (superposition-based, or QS2) quantum security...
research
07/16/2023

Format Preserving Encryption in the Bounded Retrieval Model

In the bounded retrieval model, the adversary can leak a certain amount ...
research
06/23/2023

Preventing EFail Attacks with Client-Side WebAssembly: The Case of Swiss Post's IncaMail

Traditional email encryption schemes are vulnerable to EFail attacks, wh...
research
03/21/2022

Proposal for Quantum Ciphertext-Policy Attribute-Based Encryption

A Quantum Ciphertext-Policy Attribute-Based Encryption scheme (QCP-ABE) ...
research
09/08/2021

User-generated pseudonyms through Merkle trees

A pseudonymisation technique based on Merkle trees is described in this ...

Please sign up or login with your details

Forgot password? Click here to reset