A Modular Approach to Unclonable Cryptography
Prabhanjan Ananth, Amit Behera
Abstract
We explore a new pathway to designing unclonable cryptographic primitives. We propose a new notion called unclonable puncturable obfuscation (UPO) and study its implications for unclonable cryptography. Using UPO, we present modular (and in some cases, arguably, simple) constructions of many primitives in unclonable cryptography, including, public-key quantum money, quantum copy-protection for many classes of functionalities, unclonable encryption, and single-decryption encryption.
Notably, we obtain the following new results assuming the existence of UPO:
• We show that any cryptographic functionality can be copy-protected as long as this functionality satisfies a notion of security, which we term puncturable security. Prior feasibility results focused on copy-protecting specific cryptographic functionalities.
• We show that copy-protection exists for any class of evasive functions as long as the associated distribution satisfies a preimage-sampleability condition. Prior works demonstrated copy-protection for point functions, which follows as a special case of our result.
We put forward a candidate construction of UPO and prove two notions of security, each based on the existence of (post-quantum) sub-exponentially secure indistinguishability obfuscation and one-way functions, the quantum hardness of learning with errors, and a new conjecture called simultaneous inner product conjecture.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext a40f378a-0707-487d-bee5-c2224c657320Cited by top-tier papers3
- Quantum One-Time Protection of Any Randomized AlgorithmSam Gunn, Ramis MovassaghCRYPTO 2025 · 2 citations
- Proofs of No IntrusionVipul Goyal, Justin RaizesEUROCRYPT 2026 · 1 citation
- Less is More: On Copy Complexity in Quantum CryptographyPrabhanjan Ananth, Eli GoldinCRYPTO 2026
Builds on9
- Indistinguishability obfuscation from well-founded assumptionsAayush Jain, Huijia Lin, Amit SahaiSTOC 2021 · 223 citations
- Hidden Cosets and Applications to Unclonable CryptographyAndrea Coladangelo, Jiahui Liu, Qipeng Liu, Mark ZhandryCRYPTO 2021 · 64 citations
- New Approaches for Quantum Copy-ProtectionScott Aaronson, Jiahui Liu, Qipeng Liu, Mark Zhandry et al.CRYPTO 2021 · 47 citations
- On the Feasibility of Unclonable Encryption, and MorePrabhanjan Ananth, Fatih Kaleoglu, Xingjian Li, Qipeng Liu et al.CRYPTO 2022 · 28 citations
- Another Round of Breaking and Making Quantum Money: - How to Not Build It from Lattices, and MoreJiahui Liu, Hart Montgomery, Mark ZhandryEUROCRYPT 2023 · 21 citations
Related papers
- Multi-copy Security in Quantum Cryptography and MoreAlper Çakan, Vipul Goyal, Fuyuki Kitagawa, Ryo Nishimaki et al.CRYPTO 2026
- Copy-Protection from Unclonable Puncturable Obfuscation, RevisitedPrabhanjan Ananth, Amit Behera, Zikuan Huang, Fuyuki Kitagawa et al.EUROCRYPT 2026 · 2 citations
- How to Use Quantum Indistinguishability ObfuscationAndrea Coladangelo, Sam GunnSTOC 2024 · 8 citations
- Cloning Games: A General Framework for Unclonable PrimitivesPrabhanjan Ananth, Fatih Kaleoglu, Qipeng LiuCRYPTO 2023 · 17 citations
- How (not) to Build Quantum PKE in MinicryptLongcheng Li, Qian Li, Xingjian Li, Qipeng LiuCRYPTO 2024 · 5 citations
