Rachel Zhang: SNARGs for Bounded Depth Computations Friday, February 26, 2021  1:00pm to 2:30pm Abstract: The FiatShamir heuristic allows one to make interactive protocols noninteractive by replacing the verifier with hash functions. 

Rafael Pass: On Oneway Functions and Kolmogorov Complexity Friday, February 19, 2021  1:00pm to 2:30pm
Abstract:
We prove the equivalence of two fundamental problems in the theory of computing. 

Yantian (Tina) Zhang: Classical proofs of quantum knowledge Friday, February 5, 2021  10:30am to 12:00pm Abstract: We define the notion of a proof of knowledge in the setting where the verifier is classical, but the prover is quantum, and where the witness that the prover holds is in general a quantum state. 

2 Part Seminar, Aayush Jain, Huijia (Rachel) Lin and Amit Sahai: Indistinguishability Obfuscation from WellFounded Assumptions Friday, December 4, 2020  1:00pm to 4:00pm Abstract:


Romain Gay: Indistinguishability Obfuscation from Circular Security Friday, November 20, 2020  1:00pm to 2:30pm Abstract:
We show the existence of indistinguishability obfuscators (iO) for general circuits assuming subexponential security of:  the Learning with Error (LWE) assumption (with subexponential modulustonoise ratio); 

Daniel Wichs: Candidate Obfuscation via Oblivious LWE Sampling Friday, October 30, 2020  1:00pm to 2:30pm Abstract: We present a new, simple candidate construction of indistinguishability obfuscation (iO). Our scheme is inspired by lattices and learningwitherrors (LWE) techniques, but we are unable to prove security under a standard assumption. 

Benny Applebaum: The Round Complexity of PerfectlySecure Multiparty Computation Thursday, July 2, 2020  1:00pm to 2:00pm Abstract: This talk is a followup to June 11th CIS seminar, but will be mostly selfcontained. 

Benny Applebaum: The Round Complexity of PerfectlySecure Multiparty Computation Thursday, June 11, 2020  12:00pm to 1:30pm Abstract: 

Noah Golowich: On the Power of Multiple Anonymous Messages Wednesday, December 18, 2019  2:00pm to 3:00pm Abstract: 

Muthu Venkitasubramaniam: A RoundCollapse Theorem for ComputationallySound Protocols; or, TFNP is HardonAverage in Pessiland Friday, December 13, 2019  10:30am to 12:00pm Abstract: Consider the following two fundamental open problems in complexity theory: 