Quantum Minimalism

on YouTube ↗34m

" summary

Argues that classical one-way functions are minimal because they are trivially implied by most primitives, have a simple, robust definition, admit universal combiners, and directly yield crypto; contrasts this with quantum contenders. Shows pseudo-random states require quantum-secure PRFs and quantum GGM proofs (not trivially implied, not a search problem, unclear falsifiability, no known combiners) and that one-way state generators add a verification oracle (search-style, extra correctness, no known combiner). Cites black-box separations placing these below one-way functions.

AI-written summary · about

" chapters (4)

1. 0:00The search for minimalism
2. 1:33Defining minimal assumptions
3. 17:13Case study: Pseudorandom states
4. 27:19One-way state generators

" related talks

• 12mOne-Way Functions Imply Secure Computation in a Quantum WorldAndrea Coladangelo · Meet the Fellows Welcome Event
• 56mQuantum 4Dakshita Khurana · Cryptography 10 Years Later: Obfuscation, Proof Systems, and Secure Computation Boot Camp 2025
• 58mQuantum 2Mark Zhandry · Cryptography 10 Years Later: Obfuscation, Proof Systems, and Secure Computation Boot Camp 2025
• 32mQuantum Obfuscation of Classical CircuitsPaul Christiano · Quantum Games and Protocols
• 01h 05mNew Quantum Cryptographic Primitives IMark Zhandry · Quantum and Lattices Joint Reunion Workshop
• 01h 08mNew Quantum Cryptographic Primitives IIMark Zhandry · Quantum and Lattices Joint Reunion Workshop
• 01h 13mQuantum 3Dakshita Khurana · Cryptography 10 Years Later: Obfuscation, Proof Systems, and Secure Computation Boot Camp 2025
• 20mOn the computational hardness needed for quantum cryptographyRan Canetti, Luowen Qian, Zvika Brakerski · ITCS 2023