New Quantum Cryptographic Primitives II

on YouTube ↗01h 08m

" summary

Quantum copy protection faces clear boundaries and partial constructions: learnable functions are impossible to protect and Aaronson’s 2009 quantum-oracle existence result is strengthened to a classical-oracle existence, while Anantham‑LaPlaca shows some non‑learnable functions remain unprotectable. Constructions rely on heavy tools—indistinguishability obfuscation (IO), coset-state construction and a random oracle requirement—and produce copy protection for specific PRFs, decryption and signature tokens (with an info‑theoretic conjecture later proved by Kölf & Vidick). Simpler one‑time schemes (Broadbent–Lord) give only ~0.85 simultaneous‑guess bounds; revocable and certified‑deletion variants exist but full standard‑model, reusable solutions remain open.

AI-written summary · about

" chapters (8)

1. 0:00Introduction to copy protection
2. 1:04Software watermarking
3. 8:00Quantum copy protection basics
4. 14:16Theories and known results
5. 20:21Unclonable encryption
6. 49:04Copy detection
7. 51:35Revocable cryptography
8. 1:03:21Classical communication

" related talks

• 59mAn Introduction to Quantum ObfuscationJames Bartusek · Obfuscation
• 46mObfuscation of Unitary Quantum ProgramsEr-Cheng Tang · Obfuscation
• 01h 03mFrom Program Obfuscation to Unclonable CryptographyPrabhanjan Ananth · Obfuscation
• 32mQuantum Obfuscation of Classical CircuitsPaul Christiano · Quantum Games and Protocols
• 58mQuantum 2Mark Zhandry · Cryptography 10 Years Later: Obfuscation, Proof Systems, and Secure Computation Boot Camp 2025
• 46mQuantum pseudorandomness in Algorithmica, and its implications to cryptography and complexityLuowen Qian · Minimal Complexity Assumptions for Cryptography 2023
• 01h 13mQuantum 3Dakshita Khurana · Cryptography 10 Years Later: Obfuscation, Proof Systems, and Secure Computation Boot Camp 2025
• 12mOne-Way Functions Imply Secure Computation in a Quantum WorldAndrea Coladangelo · Meet the Fellows Welcome Event