Past Program Activities

Post-Quantum Multi-Party Computation in Constant Rounds
Speaker: James Bartusek (UC Berkeley)
Apr. 21, 2020
Program: Lattices: Algorithms, Complexity, and Cryptography
Daily Tea
Apr. 20, 2020
Reading Group on MIP* = RE and its Application to Connes' Embedding Problem
Apr. 17, 2020
Daily Tea
Apr. 17, 2020
Daily Tea
Apr. 16, 2020
Laconic Function Evaluation
Speaker: Willy Quach (Northeastern University)
Apr. 16, 2020
Program: Lattices: Algorithms, Complexity, and Cryptography
Daily Tea
Apr. 15, 2020
Daily Tea
Apr. 14, 2020
Robust Polynomial Method and a Sub-Volume Law for Locally Gapped Frustration-Free Spin Systems
Speaker: Anurag Anshu (IQC)
Apr. 14, 2020
Program: The Quantum Wave in Computing
Self-Dual BKZ
Speaker: Michael Walter (IST Austria)
Apr. 14, 2020
Program: Lattices: Algorithms, Complexity, and Cryptography
Daily Tea
Apr. 13, 2020
Reading Group on MIP* = RE and its Application to Connes' Embedding Problem
Apr. 10, 2020
Daily Tea
Apr. 10, 2020
Optimal Broadcast Encryption from Pairings and LWE
Speaker: Shota Yamada (AIST)
Apr. 9, 2020
Program: Lattices: Algorithms, Complexity, and Cryptography
Daily Tea
Apr. 9, 2020
Daily Tea
Apr. 8, 2020
Daily Tea
Apr. 7, 2020
Quantum Speedup for Graph Sparsification, Cut Approximation and Laplacian Solving
Speaker: Simon Apers (INRIA)
Apr. 7, 2020
Program: The Quantum Wave in Computing
Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography
Speaker: Nicholas Genise (UC San Diego)
Apr. 7, 2020
Program: Lattices: Algorithms, Complexity, and Cryptography
Daily Tea
Apr. 6, 2020
Reading Group on MIP* = RE and its Application to Connes' Embedding Problem
Apr. 3, 2020
Quantum-for-crypto-dummies
Apr. 3, 2020
Program: Lattices: Algorithms, Complexity, and Cryptography
NIZK from LPN and Trapdoor Hash via Correlation Intractability for Approximable Relations
Speaker: Tamer Mour (Weizmann Institute of Science)
Apr. 2, 2020
Program: Lattices: Algorithms, Complexity, and Cryptography
Reading Group on MIP* = RE and its Application to Connes' Embedding Problem
Mar. 27, 2020
Quantum Seminar
Speaker: Peter Shor (MIT)
Mar. 27, 2020
Program: The Quantum Wave in Computing
Reading Group on MIP* = RE and its Application to Connes' Embedding Problem
Mar. 20, 2020
Quantum lectures for crypto dummies
Mar. 20, 2020
Program: The Quantum Wave in Computing
Secure Multi-party Quantum Computation with a Dishonest Majority
Speaker: Chris Schaffner (University of Amsterdam & QuSoft)
Mar. 17, 2020
Program: The Quantum Wave in Computing
Reading Group on MIP* = RE and its Application to Connes' Embedding Problem
Mar. 13, 2020
Non-Interactive Zero-Knowledge Arguments for QMA, With Preprocessing
Speaker: Andrea Coladangelo (Simons Institute Fellow)
Mar. 10, 2020
Program: The Quantum Wave in Computing
Reading Group on MIP* = RE and its Application to Connes' Embedding Problem
Mar. 6, 2020
Multikey FHE in the Plain Model
Speaker: Giulio Malavolta (UC Berkeley, CMU)
Mar. 5, 2020
Program: Lattices: Algorithms, Complexity, and Cryptography
Classical Simulation of High Temperature Quantum Ising Models and Open Challenges in the Simulation of Stoquastic Hamiltonians
Speaker: Elizabeth Crosson (University of New Mexico)
Mar. 3, 2020
Program: The Quantum Wave in Computing
Overview of Attacks on Ideal-SVP and Module-SVP
Speaker: Alice Pellet-Mary, KU Leuven
Mar. 3, 2020
Program: Lattices: Algorithms, Complexity, and Cryptography
Reading Group on MIP* = RE and its Application to Connes' Embedding Problem
Feb. 28, 2020
Quantum Lower Bounds for Approximate Counting via Laurent Polynomials
Speaker: Robin Kothari (Microsoft Research)
Feb. 18, 2020
Program: The Quantum Wave in Computing
Annals of Scientific Storytelling
Speaker: Siobhan Roberts (Simons Institute Journalist In Residence)
Feb. 4, 2020
Fine-Grained Complexity of Lattice Problems
Speaker: Huck Bennett, University of Michigan
Feb. 4, 2020
Program: Lattices: Algorithms, Complexity, and Cryptography
Highly Scalable Architecture for White-list Based IoT Security as a Service by ISPs
Speaker: Yehuda Afek
Dec. 12, 2019
Program: Proofs, Consensus, and Decentralizing Society
Better Late (40 Years Late!) than Never: Monday Morning Quarterbacking the Coordinated-Attack Problem
Speaker: Eli Gafni
Dec. 10, 2019
Program: Proofs, Consensus, and Decentralizing Society
Bridging the gaps between forward-secure signatures and proof-of-stake protocols
Speaker: Vanishree Rao
Dec. 5, 2019
Program: Proofs, Consensus, and Decentralizing Society
Composable analysis of Decentralized Ledgers: From Broadcast to Blockchains
Speaker: Vassilis Zikas
Dec. 3, 2019
Program: Proofs, Consensus, and Decentralizing Society
Writing for the Public: Op-Eds, Book Proposals, and Everything in Between
Speaker: Konstantin Kakaes (Simons Institute Journalist In Residence)
Nov. 26, 2019
Celo - Building A Full-Stack Cryptocurrency
Speaker: Marek Olszewski
Nov. 14, 2019
Program: Proofs, Consensus, and Decentralizing Society
Writing for the Public: Op-Eds, Book Proposals, and Everything in Between
Speaker: Konstantin Kakaes (Simons Institute Journalist In Residence)
Nov. 13, 2019
Zero-Knowledge with Constant Computational Overhead
Speaker: Jonathan Bootle
Nov. 12, 2019
Program: Proofs, Consensus, and Decentralizing Society
Introduction to Plasma
Speaker: Stefan Dziembowski
Nov. 7, 2019
Program: Proofs, Consensus, and Decentralizing Society
FlyClient: Super-Light Clients for Cryptocurrencies
Speaker: Benedikt Bunz
Oct. 31, 2019
Program: Proofs, Consensus, and Decentralizing Society
On Prover-Efficient Public-Coin Emulation of Interactive Proofs
Speaker: Gal Arnon
Oct. 29, 2019
Program: Proofs, Consensus, and Decentralizing Society
Continuous Verifiable Delay Functions
Speaker: Ilan Komargodski
Oct. 17, 2019
Program: Proofs, Consensus, and Decentralizing Society
The case for a new more mathematically streamlined model for asynchronous byzantine
Speaker: Eli Gafni
Oct. 15, 2019
Program: Proofs, Consensus, and Decentralizing Society
An Equilibrium Model of the Market for Bitcoin Mining
Speaker: Julien Prat
Oct. 8, 2019
Program: Proofs, Consensus, and Decentralizing Society
Formal Barriers to Longest-Chain Proof-of-Stake Protocols
Speaker: Alex Psomas
Oct. 3, 2019
Program: Proofs, Consensus, and Decentralizing Society
A Crash Course on Fast Interactive Proofs
Speaker: Justin Thaler
Oct. 1, 2019
Program: Proofs, Consensus, and Decentralizing Society
Competing Bandits in Matching Markets
Speaker: Michael Jordan, Lydia Liu and Horia Mania
Sep. 26, 2019
Program: Online and Matching-Based Market Design
The Law of One Price for Heterogeneous Goods
Speaker: Assaf Romm
Sep. 24, 2019
Program: Online and Matching-Based Market Design
A Continuum Model of Stable Matching with Finite Capacities
Speaker: Nick Arnosti
Sep. 19, 2019
Program: Online and Matching-Based Market Design
From Zero Knowledge to Private Transactions
Speaker: Alessandro Chiesa
Sep. 19, 2019
Program: Proofs, Consensus, and Decentralizing Society
Coda: Proof-of-stake and recursive zk-SNARKs in practice
Speaker: Izaak Meckler
Sep. 18, 2019
Program: Proofs, Consensus, and Decentralizing Society
The Adversarial Robustness of Sampling
Speaker: Eylon Yogev
Sep. 17, 2019
Program: Proofs, Consensus, and Decentralizing Society
Cryptocurrencies, Currency Competition, and the Impossible Trinity
Speaker: Linda Schilling
Sep. 12, 2019
Program: Proofs, Consensus, and Decentralizing Society
First come first served online matching: theory, applications and future research
Speaker: Gideon Weiss (The University of Haifa)
Sep. 12, 2019
Program: Online and Matching-Based Market Design
An Economic Analysis of the Bitcoin Payment System
Speaker: Jacob Leshno
Sep. 10, 2019
Program: Proofs, Consensus, and Decentralizing Society
A Cryptographic Look at Token-Curated Registries
Speaker: Sarah Meiklejohn
Sep. 5, 2019
Program: Proofs, Consensus, and Decentralizing Society
Equilibrium Existence Duality
Speaker: Alex Teytelboym
Sep. 3, 2019
Program: Online and Matching-Based Market Design
Stable Matching with Proportionality Constraints
Speaker: Rakesh Vohra (University of Pennsylvania)
Aug. 26, 2019
Program: Online and Matching-Based Market Design
Short talks + announcement of results.
Aug. 8, 2019
Program: Summer Cluster: Error-Correcting Codes and High-Dimensional Expansion
A connection between optimal AG codes and LPS Ramanujan graphs.
Speaker: Shai Evra (IAS)
Aug. 6, 2019
Program: Summer Cluster: Error-Correcting Codes and High-Dimensional Expansion
Expansion beyond eigenvalue and other pseudorandom constructions
Speaker: David Zuckerman
Aug. 1, 2019
Program: Summer Cluster: Error-Correcting Codes and High-Dimensional Expansion
Improving medical predictions by caring about uncertainty: Combining Deep Neural Networks with Bayesian methodology
Speaker: Katherine Heller
Jul. 31, 2019
Program: Foundations of Deep Learning
How To Beat Empirical Risk Minimization
Speaker: Ali Rahimi
Jul. 31, 2019
Program: Foundations of Deep Learning
Some of my favorite open problems on expanders (and related objects)
Speaker: Avi Wigderson (IAS)
Jul. 30, 2019
Program: Summer Cluster: Error-Correcting Codes and High-Dimensional Expansion
Fourier Analysis on Exotic Domains
Speaker: Yuval Filmus
Jul. 30, 2019
Program: Summer Cluster: Error-Correcting Codes and High-Dimensional Expansion
Tutorial on Lifted Codes
Speaker: Prahladh Harsha
Jul. 29, 2019
Program: Summer Cluster: Error-Correcting Codes and High-Dimensional Expansion
High-Dimensional Expanders from Expanders
Speaker: Siqi Liu
Jul. 29, 2019
Program: Summer Cluster: Error-Correcting Codes and High-Dimensional Expansion
Approximating CSPs on HDXs, and applications to codes
Speaker: Madhur Tulsiani
Jul. 25, 2019
Program: Summer Cluster: Error-Correcting Codes and High-Dimensional Expansion
Robust Bi-Tempered Logistic Loss Based on Bregman Divergences
Speaker: Manfred K. Warmuth  
Jul. 24, 2019
Program: Foundations of Deep Learning
Private Deep Learning
Speaker: Shafi Goldwasser
Jul. 24, 2019
Program: Foundations of Deep Learning
Graphs which are expanders both locally and globally
Speaker: Michael Chapman
Jul. 23, 2019
Program: Summer Cluster: Error-Correcting Codes and High-Dimensional Expansion
From local to robust testing via high-dimensional expansion
Speaker: Noga Ron Zewi
Jul. 23, 2019
Program: Summer Cluster: Error-Correcting Codes and High-Dimensional Expansion
Towards Explaining the Regularization Effect of Initial Large Learning Rate in Training Neural Networks
Speaker: Tengyu Ma
Jul. 10, 2019
Program: Foundations of Deep Learning
Reducing AI Bias using Truncated Statistics
Speaker: Constantinos Daskalakis
Jul. 3, 2019
Program: Foundations of Deep Learning
Memory, Modularity, and the Theory of Deep Learnability
Speaker: Rina Panigrahy
Jun. 26, 2019
Program: Foundations of Deep Learning
Frontiers of Efficient Neural-Network Learnability
Speaker: Adam Klivans
Jun. 19, 2019
Program: Foundations of Deep Learning
The singular values of convolutional layers
Speaker: Phil Long, Google  
Jun. 10, 2019
Program: Foundations of Deep Learning
A New Perspective on Adversarial Perturbations
Speaker: Aleksander Madry (Massachusetts Institute of Technology)
Jun. 3, 2019
Program: Foundations of Deep Learning
Privacy and Statistical Inference for Social Science Data (Data Privacy Reading Group)
May 14, 2019
Program: Data Privacy: Foundations and Applications
Real zeros and the alternatingly increasing property *starts at 10:30 a.m. sharp*
Speaker: Liam Solus (KTH Stockholm)
May 8, 2019
Program: Geometry of Polynomials
Privacy and Statistical Inference for Social Science Data (Data Privacy Reading Group)
Apr. 30, 2019
Program: Data Privacy: Foundations and Applications
Differential Privacy for Functional Summaries via the Exponential Mechanism with Applications to Functional PCA
Speaker: Matthew Reimherr (Penn State)
Apr. 24, 2019
Program: Data Privacy: Foundations and Applications
Determinantal representations of hyperbolic polynomials
Speaker: Daniel Plaumann (TU Dortmund)
Apr. 24, 2019
Program: Geometry of Polynomials
Problems in Matrix Variables: A Taste of Noncommutative (Convex) Algebraic Geometry *starts at 10:15 a.m. sharp*
Speaker: Bill Helton (UC San Diego) 
Apr. 24, 2019
Program: Geometry of Polynomials
Privacy and Statistical Inference for Social Science Data (Data Privacy Reading Group)
Apr. 23, 2019
Program: Data Privacy: Foundations and Applications
Optimality and large-scale learning under local privacy
Speaker: John Duchi (Stanford)
Apr. 17, 2019
Program: Data Privacy: Foundations and Applications
Colouring locally sparse graphs via the hard-core model
Speaker: Ewan Davies, Simons Institute
Apr. 17, 2019
Program: Geometry of Polynomials
Ground states and Hyperuniformity properties for models of interacting gas. 
Speaker: Shirshendu Ganguly, UC Berkeley
Apr. 17, 2019
Program: Geometry of Polynomials
Privacy and Statistical Inference for Social Science Data (Data Privacy Reading Group)
Apr. 16, 2019
Program: Data Privacy: Foundations and Applications
Google Talks Field Trip
Apr. 5, 2019
Program: Data Privacy: Foundations and Applications
Next mini course: McMullen’s polytope algebra
Speaker: Raman Sanyal
Apr. 4, 2019
Program: Geometry of Polynomials
Differentially Private Learning of Geometric Concepts
Speaker: Uri Stemmer (Ben Gurion University)
Apr. 3, 2019
Program: Data Privacy: Foundations and Applications

Pages