–
Welcome and Introduction
–
On Breaking Encryption With A Statistical Zero-Knowledge Oracle
Andrej Bogdanov (The Chinese University of Hong Kong)
–
Break
–
Average-Case Hardness Of CSPs
Benny Applebaum (Tel-Aviv University)
–
Lunch
–
Indistinguishability Obfuscation and Learning Problems
Aayush Jain (NTT Research)
–
Break
–
Low-Complexity Cryptography and Simple Hard-to-Learn Functions
Yuval Ishai (Technion - Israel Institute of Technology)
–
Reception
–
On The Hardness Of Average-Case k-SUM
Noah Stephens-Davidowitz (Cornell University)
–
Break
–
A Few Simple Average-Case Reduction Techniques And Their Surprising Effectiveness
Guy Bresler (MIT)
–
Lunch
–
Open Problems Session
–
Break
–
Analyzing Average-Case Complexity by Meta-Complexity
Shuichi Hirahara (National Institute of Informatics, Tokyo)
–
Sum-Of-Squares Lower Bound for Statistical Problems
Samuel Hopkins (UC Berkeley)
–
Break
–
Computational trade-offs in graph models
Quentin Berthet (University of Cambridge)
–
Lunch
–
Worst-Case Robustness in Machine Learning
Aditi Raghunathan (Stanford)
–
Break
–
On the Cryptographic Hardness of Learning Single Periodic Neurons
Ilias Zadik (Massachusetts Institute of Technology)