Black-Box Separations in Quantum Cryptography *Presented Virtually

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


Duration: 47:31
355 views
5

Mohammad Mahmoody (University of Virginia)
https://simons.berkeley.edu/talks/mohammad-mahmoody-university-virginia-2023-05-05
Minimal Complexity Assumptions for Cryptography

Note: This talk will be presented virtually. | Black-box separations in cryptography characterize the barriers between different primitives so long as the reductions between them is black-box. With the emergence of quantum tools in cryptography, many results are being revisited; black-box separations are no exception in this regard.

In this talk we cover some efforts for proving black-box separations for various primitive pairs. In particular, we talk about (conditionally) extending the classical result of Impagliazzo and Riduch from 89 to the quantum setting, and some related (some open) problems and barriers (for full unconditional separations).



Other Videos By Simons Institute for the Theory of Computing


2023-05-24Contraction of Markov kernels and differential privacy (PART I)
2023-05-23KEYNOTE: Differential Privacy & Variants
2023-05-23Information-theoretic Foundations of Generative Adversarial Models: ...
2023-05-23Generalization bounds for Neural Network Based Decoders
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


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