Quantum Minimalism

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=7cqnrASfjco


Duration: 34:01
319 views
5

Mark Zhandry (NTT Research)
https://simons.berkeley.edu/talks/mark-zhandry-ntt-research-2023-05-05
Minimal Complexity Assumptions for Cryptography

One-way functions are often referred to as the “minimal” cryptographic assumption. Recent revelations that objects “below” one-way functions may be possible quantumly have sparked a scramble to find a new minimal quantum assumption. In this talk, I take a step back and explore what makes one-way functions minimal in the first place and what we should be searching for quantumly.



Other Videos By Simons Institute for the Theory of Computing


2023-05-23Optimal Neural Network Compressors and the Manifold Hypothesis
2023-05-23Fairness without Imputation: A Decision Tree Approach for Fair Prediction with Missing Values
2023-05-23Secure Distributed Matrix Multiplication
2023-05-23On the Robustness to Misspecification of α-Posteriors and Their Variational Approximations
2023-05-23Majorizing Measures, Codes, and Information
2023-05-22KEYNOTE: A (Con)Sequential View of Information for Statistical Learning and Optimization
2023-05-06Black-Box Separations in Quantum Cryptography *Presented Virtually
2023-05-06Quantum pseudorandomness in Algorithmica, and its implications to cryptography and complexity
2023-05-06On the Computational Hardness Needed for Quantum Cryptography
2023-05-06Commitments to Quantum States
2023-05-06Quantum Minimalism
2023-05-05Cryptography with Certified Deletion *Presented Virtually
2023-05-05Black-Hole Radiation Decoding as a Cryptographic Assumption
2023-05-05Geometry of Secure Computation
2023-05-05Collision-Resistance from Multi-Collision-Resistance
2023-05-05New Ways to Garble Arithmetic Circuits
2023-05-05Unclonable Polymers and Their Cryptographic Applications
2023-05-05Batch Proofs are Statistically Hiding
2023-05-05Advisor-Verifier-Prover Games and the Hardness of Information Theoretic Cryptography
2023-05-04Doubly Efficient Private Information Retrieval and Fully Homomorphic RAM Computation from Ring LWE
2023-05-04Assumptions in cryptography and complexity theory


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Minimal Complexity Assumptions for Cryptography
Mark Zhandry