Cryptographic Hardness of Correlated Sampling

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


Duration: 30:30
150 views
2

Russell Impagliazzo (UC San Diego)
https://simons.berkeley.edu/talks/russell-impagliazzo-uc-san-diego-2023-05-02
Minimal Complexity Assumptions for Cryptography



Other Videos By Simons Institute for the Theory of Computing


2023-05-04Mutual Empowerment Between Circuit Obfuscation and Circuit Minimization
2023-05-04Tales of Obfuscation in Bounded Arithmetic, Metacomplexity, and Differential Privacy
2023-05-04Tutorial on obfuscation
2023-05-04Fine-Grained Cryptography
2023-05-04On the Complexity of Two-Party Differential Privacy
2023-05-03Communication Complexity, Streaming and Computational Assumptions
2023-05-03NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach
2023-05-03Capturing One-Way Functions via NP-Hardness of Meta-Complexity
2023-05-03Derandomization: A Quick Tutorial
2023-05-03SNARGs Beyond Non-Signaling
2023-05-03Cryptographic Hardness of Correlated Sampling
2023-05-03Incompressiblity and Next-Block Pseudoentropy
2023-05-02Cryptography and Kolmogorov Complexity: A Quick Tutorial
2023-05-02Constant-Round Arguments from One-Way Functions
2023-05-02New Techniques for Zero-Knowledge: Leveraging Inefficient Provers to Reduce Assumptions, ...
2023-05-02Hard Languages in NP ∩ coNP and NIZK Proofs from Unstructured Hardness
2023-05-02Non-interactive Universal Arguments
2023-05-02Rate-1 BARGs via fully-local SSB hash families
2023-05-02Correlation Intractability and SNARGs from Sub-exponential DDH
2023-05-01Tutorial on Proof Systems
2023-04-29Connections Between Multicalibration and Doubly Robust Estimation


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