Unclonable Encryption, Revisited

Prabhanjan Ananth; Fatih Kaleoglu

Paper 2021/412

Unclonable Encryption, Revisited

Prabhanjan Ananth and Fatih Kaleoglu

Abstract

Unclonable encryption, introduced by Broadbent and Lord (TQC'20), is an encryption scheme with the following attractive feature: given a ciphertext, an adversary cannot create two ciphertexts both of which decrypt to the same message as the original ciphertext. We revisit this notion and show the following: - Reusability: The constructions proposed by Broadbent and Lord have the disadvantage that they either guarantee one-time security (that is, the encryption key can only be used once to encrypt the message) in the plain model or they guaranteed security in the random oracle model. We construct unclonable encryption schemes with semantic security. We present two constructions from minimal cryptographic assumptions: (i) a private-key unclonable encryption scheme assuming post-quantum one-way functions and, (ii) a public-key unclonable encryption scheme assuming a post-quantum public-key encryption scheme. -Lower Bound and Generalized Construction: We revisit the information-theoretic one-time secure construction of Broadbent and Lord. The success probability of the adversary in their construction was guaranteed to be , where is the length of the message. It was interesting to understand whether the ideal success probability of (negligibly close to) was unattainable. We generalize their construction to be based on a broader class of monogamy of entanglement games (while their construction was based on BB84 game). We demonstrate a simple cloning attack that succeeds with probability against a class of schemes including that of Broadbent and Lord. We also present a cloning attack exclusively against their scheme. - Implication to Copy-Protection: We show that unclonable encryption, satisfying a stronger property, called unclonable-indistinguishability (defined by Broadbent and Lord), implies copy-protection for a simple class of unlearnable functions. While we currently don't have encryption schemes satisfying this stronger property, this implication demonstrates a new path to construct copy-protection.

Note: .

Metadata

Available format(s): PDF
Category: Foundations
Publication info: A minor revision of an IACR publication in TCC 2021
Keywords: Quantum cryptography
Contact author(s): prabhanjan @ cs ucsb edu
kaleoglu @ ucsb edu
History: 2021-09-15: last of 4 revisions; 2021-03-30: received; See all versions
Short URL: https://ia.cr/2021/412
License: CC BY

BibTeX

@misc{cryptoeprint:2021/412,
      author = {Prabhanjan Ananth and Fatih Kaleoglu},
      title = {Unclonable Encryption, Revisited},
      howpublished = {Cryptology {ePrint} Archive, Paper 2021/412},
      year = {2021},
      url = {https://eprint.iacr.org/2021/412}
}