From Worst-Case Hardness of $\mathsf{NP}$ to Quantum Cryptography via Quantum Indistinguishability Obfuscation
Tomoyuki Morimae, Yuki Shirakawa, Takashi Yamakawa

TL;DR
This paper explores the potential of quantum indistinguishability obfuscation (iO) to construct various cryptographic primitives under quantum hardness assumptions, extending classical results and introducing new quantum cryptographic schemes.
Contribution
It defines variants of quantum iO, identifies cryptographic primitives achievable from quantum iO and quantum NP-hardness, and provides a new construction of one-way functions from classical iO.
Findings
Constructs pseudorandom unitaries and quantum encryption schemes from quantum iO.
Shows quantum iO implies several cryptographic primitives under quantum NP-hardness.
Provides a new simpler construction of one-way functions from classical iO and NP-hardness.
Abstract
Indistinguishability obfuscation (iO) has emerged as a powerful cryptographic primitive with many implications. While classical iO, combined with the infinitely-often worst-case hardness of , is known to imply one-way functions (OWFs) and a range of advanced cryptographic primitives, the cryptographic implications of quantum iO remain poorly understood. In this work, we initiate a study of the power of quantum iO. We define several natural variants of quantum iO, distinguished by whether the obfuscation algorithm, evaluation algorithm, and description of obfuscated program are classical or quantum. For each variant, we identify quantum cryptographic primitives that can be constructed under the assumption of quantum iO and the infinitely-often quantum worst-case hardness of (i.e., ). In particular, we construct…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Cryptography and Data Security · Physical Unclonable Functions (PUFs) and Hardware Security
