–
Coffee and Check-In
–
Introduction from Simons Institute
–
Secure Computation and Low-Complexity Cryptography

Yuval Ishai (Technion and AWS)
–
Break
–
Geometry of Secure Computation

Hemanta Maji (Purdue University)
–
Lunch
–
Beyond Boolean Circuits in Garbled Circuits

David Heath (UIUC)
–
Break
–
BitGC: Garbled Circuits with 1 Bit per Gate

Xiao Wang (Northwestern University)
–
A Unified Framework for Succinct Garbling from Homomorphic Secret Sharing

Rachel Lin (University of Washington)
–
Coffee and Check-In
–
The Communication Complexity Landscape of Information-theoretic MPC

Arpita Patra (Indian Institute of Science)
–
Break
–
On the Optimal Round Complexity of Multi-Party Computation in the Plain Model

Luisa Siniscalchi (Technical University of Denmark (DTU))
–
Lunch (on your own)
–
Peeking into the Future: MPC Resilient to Super-Rushing Adversaries

Ran Cohen (Reichman University)
–
Broadcast Optimal Multi-Party Computation

Divya Ravi (University of Amsterdam)
–
Break
–
Towards Scalable Constant-Round MPC from Minimal Assumptions via Round Collapsing

Vipul Goyal (NTT Research)
–
How to Share an NP Statement or Combiners for Zero-Knowledge Proofs

Benny Applebaum (Tel-Aviv University)
–
Coffee and Check-In
–
Private information retrieval at 30: Achievements, disappointments, and open problems

Henry Corrigan-Gibbs (MIT)
–
Break
–
Lower-Bounds on Public-Key Operations in PIR

Mohammad Hajiabadi (University of Waterloo)
–
Lunch (on your own)
–
The Concrete Security of Two-Party Computation: Simple Definitions, and Tight Proofs for PSI and OPRFs

Mihir Bellare (UCSD)
–
PULSE: Parallel Private Set Union for Large-Scale Entities

Ni Trieu (Arizona State University)
–
Break
–
Distance-Aware OT with Application to Fuzzy PSI

Jaspal Singh (Purdue University, Georgia Tech)
–
Updatable Private Set Intersection

Peihan Miao (Brown University)
–
Coffee and Check-In
–
Efficient Modular Arithmetic using Vectorization on CPUs and GPUs

Srini Devadas (Massachusetts Institute of Technology)
–
Optimizing Pseudorandom Correlation Generators from LPN

Peter Rindal (Visa Research)
–
Break
–
Multi-Party Distributed Point Functions

Mingyuan Wang (New York University, Shanghai)
–
Lunch (on your own)
–
On the Parallel Composition of Authenticated Byzantine Agreement

Juan Garay (Texas A&M University)
–
On the Adaptive Security of Key-Unique Threshold Signatures

Chelsea Komlo (University of Waterloo)
–
Break
–
Recent Advances in Asynchronous Multi-Party Computation

Chen-Da Liu-Zhang (Lucerne University of Applied Sciences and Arts & Web3 Found…
–
New Techniques for Building Information-Theoretic Asynchronous MPC with Linear Communication

Yifan Song (Tsinghua University)
–
Coffee and Check-In
–
The modern anonymous credential (how ZK landed in Google Wallet)

Abhi Shelat (Northeastern)
–
Break
–
Privacy Preserving Aggregation of Ad Conversions using MPC

Daniel Masny (Meta)
–
Lunch (on your own)
–
From 10,000-Party Protocols to Vibe Coding ZK: Engineering Cryptography Through Black-Box Design

Muthu Venkitasubramaniam (Ligero Inc.)
–
Break
–
Secure Computation in Action: Real-World Deployments in Finance

Antigoni Polychroniadou (JP Morgan)
–
Willow: Secure Aggregation with One-Shot Clients

Mariana Raykova (Google)
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