Cryptography and Information Security (CIS) Seminar

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:

Noah Golowich: On the Power of Multiple Anonymous Messages
Wednesday, December 18, 2019 - 2:00pm to 3:00pm
Abstract: 
Muthu Venkitasubramaniam: A Round-Collapse Theorem for Computationally-Sound Protocols; or, TFNP is Hard-on-Average in Pessiland
Friday, December 13, 2019 - 10:30am to 12:00pm
Abstract: Consider the following two fundamental open problems in complexity theory:
Dhiraj Holden: No-Signaling Proofs with sqrt(log⁡ n) Provers is in PSPACE
Friday, December 6, 2019 - 10:30am to 12:00pm

Abstract: No-signaling proofs, motivated by quantum computation, have found applications in cryptography and hardness of approximation. An important open problem is characterizing the power of no-signaling proofs.

Ashutosh Kumar: Securing Secret Sharing Against Leakage and Tampering
Friday, November 22, 2019 - 10:30am to 12:00pm
ABSTRACT: Secret sharing is one of the most classical and widely used cryptographic primitives.

Pages

Subscribe to Cryptography and Information Security (CIS) Seminar