Secure Computation

Program

Cryptography 10 Years Later: Obfuscation, Proof Systems, and Secure Computation

Location

Calvin Lab auditorium

Date

Monday, Aug. 4 – Friday, Aug. 8, 2025

Back to calendar

9 – 9:20 a.m.

Coffee and Check-In

9:20 – 9:30 a.m.

Introduction from Simons Institute

9:30 – 10:30 a.m.

Secure Computation and Low-Complexity Cryptography

Yuval Ishai (Technion and AWS)

10:30 – 11:15 a.m.

Break

11:15 – 11:45 a.m.

Geometry of Secure Computation

Hemanta Maji (Purdue University)

11:45 a.m. – 1:45 p.m.

Lunch (on your own)

1:45 – 2:45 p.m.

Beyond Boolean Circuits in Garbled Circuits

David Heath (UIUC)

2:45 – 3:30 p.m.

Break

3:30 – 4 p.m.

BitGC: Garbled Circuits with 1 Bit per Gate

Xiao Wang (Northwestern University)

4 – 4:30 p.m.

A Unified Framework for Succinct Garbling from Homomorphic Secret Sharing

Rachel Lin (University of Washington)

4:30 – 5 p.m.

Reception

9 – 9:30 a.m.

Coffee and Check-In

9:30 – 10:30 a.m.

The Communication Complexity Landscape of Information-theoretic MPC

Arpita Patra (Indian Institute of Science)

10:30 – 11:15 a.m.

Break

11:15 – 11:45 a.m.

On the Optimal Round Complexity of Multi-Party Computation in the Plain Model

Luisa Siniscalchi (Technical University of Denmark (DTU))

11:45 a.m. – 1:45 p.m.

Lunch (on your own)

1:45 – 2:15 p.m.

Peeking into the Future: MPC Resilient to Super-Rushing Adversaries

Ran Cohen (Reichman University)

2:15 – 2:45 p.m.

Broadcast Optimal Multi-Party Computation

Divya Ravi (University of Amsterdam)

2:45 – 3:30 p.m.

Break

3:30 – 4 p.m.

Towards Scalable Constant-Round MPC from Minimal Assumptions via Round Collapsing

Vipul Goyal (NTT Research)

4 – 4:30 p.m.

How to Share an NP Statement or Combiners for Zero-Knowledge Proofs

Benny Applebaum (Tel-Aviv University)

9 – 9:30 a.m.

Coffee and Check-In

9:30 – 10:30 a.m.

Private information retrieval at 30: Achievements, disappointments, and open problems

Henry Corrigan-Gibbs (MIT)

10:30 – 11:15 a.m.

Break

11:15 – 11:45 a.m.

Lower-Bounds on Public-Key Operations in PIR

Mohammad Hajiabadi (University of Waterloo)

11:45 a.m. – 1:45 p.m.

Lunch (on your own)

1:45 – 2:15 p.m.

The Concrete Security of Two-Party Computation: Simple Definitions, and Tight Proofs for PSI and OPRFs

Mihir Bellare (UCSD)

2:15 – 2:45 p.m.

PULSE: Parallel Private Set Union for Large-Scale Entities

Ni Trieu (Arizona State University)

2:45 – 3:30 p.m.

Break

3:30 – 4 p.m.

Distance-Aware OT with Application to Fuzzy PSI

Jaspal Singh (Purdue University, Georgia Tech)

4 – 4:30 p.m.

Updatable Private Set Intersection

Peihan Miao (Brown University)

9 – 9:30 a.m.

Coffee and Check-In

9:30 – 10 a.m.

Efficient Modular Arithmetic using Vectorization on CPUs and GPUs

Srini Devadas (Massachusetts Institute of Technology)

10 – 10:30 a.m.

Optimizing Pseudorandom Correlation Generators from LPN

Peter Rindal (Visa Research)

10:30 – 11:15 a.m.

Break

11:15 – 11:45 a.m.

Multi-Party Distributed Point Functions

Mingyuan Wang (New York University, Shanghai)

11:45 a.m. – 1:45 p.m.

Lunch (on your own)

1:45 – 2:15 p.m.

Is It Even Possible? On the Parallel Composition of Asynchronous MPC Protocols

Juan Garay (Texas A&M University)

2:15 – 2:45 p.m.

On the Adaptive Security of Key-Unique Threshold Signatures

Chelsea Komlo (University of Waterloo)

2:45 – 3:30 p.m.

Break

3:30 – 4 p.m.

Recent Advances in Asynchronous Multi-Party Computation

Chen-Da Liu-Zhang (Lucerne University of Applied Sciences and Arts & Web3 Found…

4 – 4:30 p.m.

New Techniques for Building Information-Theoretic Asynchronous MPC with Linear Communication

Yifan Song (Tsinghua University)

9 – 9:30 a.m.

Coffee and Check-In

9:30 – 10:30 a.m.

The modern anonymous credential (how ZK landed in Google Wallet)

Abhi Shelat (Northeastern)

10:30 – 11:15 a.m.

Break

11:15 – 11:45 a.m.

Privacy Preserving Aggregation of Ad Conversions using MPC

Daniel Masny (Meta)

11:45 a.m. – 1:45 p.m.

Lunch (on your own)

1:45 – 2:45 p.m.

From 10,000-Party Protocols to Vibe Coding ZK: Engineering Cryptography Through Black-Box Design

Muthu Venkitasubramaniam (Ligero Inc.)

2:45 – 3:30 p.m.

Break

3:30 – 4 p.m.

Secure Computation in Action: Real-World Deployments in Finance

Antigoni Polychroniadou (JP Morgan)

4 – 4:30 p.m.

Willow: Secure Aggregation with One-Shot Clients

Mariana Raykova (Google)