Paper 2022/884

On the Feasibility of Unclonable Encryption, and More

Prabhanjan Ananth, University of California, Santa Barbara
Fatih Kaleoglu, University of California, Santa Barbara
Xingjian Li, Tsinghua University
Qipeng Liu, Simons Institute for the Theory of Computing
Mark Zhandry, Princeton University, NTT Research
Abstract

Unclonable encryption, first introduced by Broadbent and Lord (TQC'20), is a one-time encryption scheme with the following security guarantee: any non-local adversary (A, B, C) cannot simultaneously distinguish encryptions of two equal length messages. This notion is termed as unclonable indistinguishability. Prior works focused on achieving a weaker notion of unclonable encryption, where we required that any non-local adversary (A, B, C) cannot simultaneously recover the entire message m. Seemingly innocuous, understanding the feasibility of encryption schemes satisfying unclonable indistinguishability (even for 1-bit messages) has remained elusive. We make progress towards establishing the feasibility of unclonable encryption. - We show that encryption schemes satisfying unclonable indistinguishability exist unconditionally in the quantum random oracle model. - Towards understanding the necessity of oracles, we present a negative result stipulating that a large class of encryption schemes cannot satisfy unclonable indistinguishability. - Finally, we also establish the feasibility of another closely related primitive: copy-protection for single-bit output point functions. Prior works only established the feasibility of copy-protection for multi-bit output point functions or they achieved constant security error for single-bit output point functions.

Metadata
Available format(s)
PDF
Category
Foundations
Publication info
A minor revision of an IACR publication in CRYPTO 2022
Keywords
Unclonable Cryptography
Contact author(s)
qipengliu0 @ gmail com
History
2022-07-07: approved
2022-07-06: received
See all versions
Short URL
https://ia.cr/2022/884
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2022/884,
      author = {Prabhanjan Ananth and Fatih Kaleoglu and Xingjian Li and Qipeng Liu and Mark Zhandry},
      title = {On the Feasibility of Unclonable Encryption, and More},
      howpublished = {Cryptology {ePrint} Archive, Paper 2022/884},
      year = {2022},
      url = {https://eprint.iacr.org/2022/884}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.