Obfuscation is an immensely powerful tool that enables us to construct essentially any other cryptographic primitive one can dream of. This workshop will focus on recent progress in obfuscation, including constructions and novel applications, as well as the challenges that still remain.

–
Coffee and Check-In
–
Talk By
Huijia Lin (University of Washington)
–
Break
–
Indistinguishability Obfuscation from Bilinear Maps and LPN Variants
Neekon Vafa (MIT)
–
Lunch (on your own)
–
Talk By
Ran Canetti (Boston University)
–
Break
–
Beyond P versus NP: Using Complexity Theory in Obfuscation and Vice-Versa
Rahul Ilango (MIT)
–
Computational Wiretap Coding from Indistinguishability Obfuscation
Paul Lou (UCLA)
–
Reception
–
Coffee and Check-In
–
Obfuscation via GGH15 Encodings, 10 Years Later
Hoeteck Wee (NTT Research)
–
Break
–
Lattice Assumptions with Hints: Succinct LWE and its Applications
David Wu (UT Austin)
–
Lunch (on your own)
–
Pseudorandom Obfuscation
Nico Döttling (CISPA)
–
Break
–
Lattice-Based Post-Quantum iO from Circular Security with Random Opening Assumption
Yao Ching Hsieh (University of Washington)
–
Talk by
Sora Suegami (Ethereum Foundation - Machina iO)
–
Coffee and Check-In
–
A Pure Indistinguishability Obfuscation Approach to Adaptively-Sound SNARGs for NP
Brent Waters (UT Austin and NTT Research)
–
Break
–
Toward Obfuscation from Affine Determinant Programs
Mark Zhandry (NTT Research)
–
Lunch (on your own)
–
Indistinguishability Obfuscation via Mathematical Proofs
Zhengzhong Jin (Northeastern University)
–
Break
–
Talk By
Elaine Shi (Carnegie Mellon University)
–
Succinct Obfuscation via Propositional Proofs (or: How to use pv-IO)
Surya Mathialagan (MIT)
–
Hike
–
Coffee and Check-In
–
Attribute-Based Encryption (and More) for Circuits of Unbounded Depth from Lattices
Ji Luo (Boston University)
–
Succinct Randomized Encodings from Laconic Function Evaluation, Faster and Simpler
Rachit Garg (New York University)
–
Break
–
Succinct Randomized Encodings from Lattices
Giulio Malavolta (Bocconi University)
–
Lunch (on your own)
–
From Program Obfuscation to Unclonable Cryptography
Prabhanjan Ananth (UC Santa Barbara)
–
Break
–
Talk By
James Bartusek (NYU)
–
Quantum State Obfuscation of Unitary Quantum Programs
Er-Cheng Tang (University of Washington)
–
Coffee and Check-In
–
Computing on Encrypted Data via Secret Dual Codes / Yuval Ishai (Technion & AWS)
Yuval Ishai (Technion and AWS)
–
Break
–
Something about new average-case hard problems?
Tselil Schramm (Stanford University)
–
Lunch (on your own)
–
Somewhat Homomorphic Encryption from Linear Homomorphism and Sparse LPN
Alexandra Henzinger (MIT)
–
Break
–
Talk By
Riddhi Ghosal (UCLA)
–
Lower Bounds on the Overhead of Indistinguishability Obfuscation
Noam Mazor (Tel Aviv University)
Register

Registration is required for in-person attendance, access to the livestream, and early access to the recording. Space may be limited, and you are advised to register early. 

For additional information please visit: https://simons.berkeley.edu/participating-workshop.

Please note: the Simons Institute regularly captures photos and video of activity around the Institute for use in videos, publications, and promotional materials. 

Register Now