Cryptography and Information Security (CIS) Seminar
 |
Alex Lombardi: Fiat-Shamir via List-Recoverable Codes Friday, March 5, 2021 - 1:00pm to 2:30pm Abstract: We construct hash functions that, assuming the hardness of LWE, securely realize the Fiat-Shamir transform (in the standard model) for the following rich classes of protocols: |
 |
Jiayu Zhang: Succinct Blind Quantum Computation Using a Random Oracle Friday, March 19, 2021 - 1:00pm to 2:30pm |
 |
Rachel Zhang: SNARGs for Bounded Depth Computations Friday, February 26, 2021 - 1:00pm to 2:30pm Abstract: The Fiat-Shamir heuristic allows one to make interactive protocols non-interactive by replacing the verifier with hash functions. |
 |
Rafael Pass: On One-way 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 Well-Founded 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 modulus-to-noise 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 learning-with-errors (LWE) techniques, but we are unable to prove security under a standard assumption. |
 |
Benny Applebaum: The Round Complexity of Perfectly-Secure Multiparty Computation Thursday, July 2, 2020 - 1:00pm to 2:00pm Abstract: This talk is a follow-up to June 11th CIS seminar, but will be mostly self-contained. |
 |
Benny Applebaum: The Round Complexity of Perfectly-Secure Multiparty Computation Thursday, June 11, 2020 - 12:00pm to 1:30pm Abstract: |
Pages
