Black-Box Uselessness: Composing Separations in Cryptography

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


Duration: 36:40
341 views
9

12th Innovations in Theoretical Computer Science Conference (ITCS 2021)
http://itcs-conf.org/

Black-Box Uselessness: Composing Separations in Cryptography

Geoffroy Couteau (CNRS & IRIF)
Pooya Farshim (University of York)
Mohammad Mahmoody (University of Virginia)



Other Videos By Simons Institute for the Theory of Computing


2021-01-15A Generalized Matching Reconfiguration Problem
2021-01-15Agnostic learning with unknown utilities
2021-01-15Quantum versus Randomized Communication Complexity, with Efficient Players
2021-01-15No quantum speedup over gradient descent for non-smooth convex optimization
2021-01-15Sequential Defaulting in Financial Networks
2021-01-15Non-quasi-linear Agents in Quasi-linear Mechanisms
2021-01-15Online Search With a Hint
2021-01-15Time-Space Lower Bounds for Proof Systems with Quantum and Randomized Verifiers
2021-01-15Robust Quantum Entanglement at (nearly) Room Temperature
2021-01-15Pseudobinomiality of the Sticky Random Walk
2021-01-15Black-Box Uselessness: Composing Separations in Cryptography
2021-01-15Tiered Random Matching Markets: Rank is Proportional to Popularity
2021-01-15Relaxing Common Belief for Social Networks
2021-01-15Total Functions in the Polynomial Hierarchy
2021-01-15Ordered Graph Limits and Their Applications
2021-01-15Shrinkage under random projections, and cubic formula lower bounds in AC^0
2021-01-15Interactive Proofs for Verifying Machine Learning
2021-01-15Lower Bounds on the Running Time of Two-Way Quantum Finite Automata and Sublogarithmic-Space Quantum
2021-01-15On the Complexity of #CSP^d
2021-01-15Sampling Arborescences in Parallel
2021-01-15Explicit SoS lower bounds from high-dimensional expanders