All talks are listed in Pacific Time.

–
Opening Remarks
–
Continuous LWE
Oded Regev
–
On the Hardness of the NTRU Problem
Alice Pellet-Mary (University of Bordeaux)
–
On Bounded Distance Decoding with Predicate: Breaking the "Lattice Barrier" for the Hidden Number Problem
Nadia Heninger (UCSD)
–
Break
–
Decentralized Multi-Authority ABE for DNFs from LWE
Ilan Komargodski (Hebrew University and NTT Research)
–
Multiparty Reusable Non-Interactive Secure Computation from LWE
Fabrice Benhamouda (Algorand Foundation)
–
Break
–
The Convergence of Slide-type Reductions
Michael Walter (IST Austria)
–
On the Relationship Between Lattice Problems Across Different L_p Norms
Noah Stephens-Davidowitz (Cornell)
–
Lower Bounds on Lattice Sieving and Information Set Decoding
Elena Kirshanova (I.Kant Baltic Federal University)
–
Dual Lattice Attacks for Closest Vector Problems (With Preprocessing)
Thijs Laarhoven (Eindhoven University of Technology)
–
What is Lattice Point Enumeration Up to These Days?
Martin Albrecht (Royal Holloway, University of London)
–
Break
–
Indistinguishability Obfuscation without LWE
Amit Sahai (UCLA)
–
Counterexamples to Circular Security-Based iO
Sam Hopkins (UC Berkeley)
–
Break
–
Post-Quantum Proofs of Knowledge from QLWE
Prabhanjan Ananth (UC Santa Barbara)
–
SNARGs and BARGs from LWE
Arka Rai Choudhuri (Johns Hopkins University)
–
Time- and Space-Efficient Arguments from Groups of Unknown Order
Justin Holmgren (NTT Research)
–
Deniable Fully Homomorphic Encryption from LWE
Shweta Agrawal (IIT Madras)
–
Break
–
SNARGs and PPAD Hardness from Sub-exponential LWE
Ruta Jawale (University of Illinois at Urbana-Champaign)
–
Fiat-Shamir via List-Recoverable Codes
Alex Lombardi (MIT)