Dhiraj Holden: NoSignaling Proofs with sqrt(log n) Provers is in PSPACE Friday, December 6, 2019  10:30am to 12:00pm Abstract: Nosignaling proofs, motivated by quantum computation, have found applications in cryptography and hardness of approximation. An important open problem is characterizing the power of nosignaling 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. 

Daniel Wichs: Extracting Randomness from ExractorDependent Sources Friday, November 15, 2019  10:30am to 12:00pm Abstract: We revisit the wellstudied problem of extracting nearly uniform randomness from an arbitrary source of sufficient minentropy. 

Rishab Goyal: Mixed Functional Encryption: A new stepping stone towards efficient tracing Friday, November 8, 2019  10:30am to 12:00pm Abstract: 

Henry Yuen: Perfect zero knowledge for quantum multiprover interactive proofs Friday, October 25, 2019  10:30am to 12:00pm Abstract: In a seminal 1988 paper, BenOr, Goldwasser, Kilian, and Wigderson (BGKW) introduced the model of multiprover interactive proofs (MIPs), and furthermore showed that zero knowledge can always be attained in this model without computational assumptions. 

Rotem Tsabary: Fully Secure AttributeBased Encryption for tCNF from LWE Friday, October 11, 2019  10:30am to 12:00pm Abstract: 

Christopher Peikert: Noninteractive Zero Knowledge for NP from Learning With Errors Friday, October 18, 2019  10:30am to 12:00pm Abstract:
We finally close the longstanding problem of constructing a 

Adrienne Mannov: A Call for CryptoAnthropology Friday, October 11, 2019  4:00pm to 5:00pm Abstract: As a social anthropologist, cryptography is interesting because what counts as secure, what constitutes trust, and how sensitive information is perceived are not only cryptographic questions but deeply social ones. 

Ran Gelles: Optimal ShortCircuit Resilient Formulas Friday, July 26, 2019  10:30am to 12:00pm Abstract: We consider faulttolerant boolean formulas in which the output of a faulty gate is shortcircuited to one of the gate’s inputs. A recent result by Kalai et al. 

Yevgeniy Dodis (NYU): Seedless Fruit is the Sweetest: Random Number Generation, Revisited Friday, April 12, 2019  10:30am to 12:00pm Abstract: The need for highquality randomness in cryptography makes 