My apologies.  We have technical problems in the lecture hall so the talk cannot be live-streamed.  However a recording will be made available on the CS Youtube page here: https://www.youtube.com/channel/UC5tTXQLklM6OQlN1kl7cKXQ 

Regards,
Emily

From: "Emily Lawrence" <emilyl@cs.princeton.edu>
To: "talks" <talks@lists.cs.princeton.edu>
Sent: Thursday, February 17, 2022 9:00:00 AM
Subject: [talks] Colloquium Speaker Yael Tauman Kalai: TODAY at 12:30pm

CS Colloquium Speaker
Speaker: Yael Tauman Kalai, Microsoft Research and MIT
Date: Thursday, Feb 17, 2022
Time: 12:30pm EST
Host: Prof. Ran Raz
Location: Live-stream online
View live-stream online here: https://mediacentrallive.princeton.edu/  

Title: Efficient Verification of Computation

Abstract:  Efficient verification of computation is fundamental to computer science, and is at the heart of the P vs. NP question. Recently it has had growing practical significance, especially with the increasing popularity of blockchain technologies and cloud computing.  In this talk, I will present schemes for verifying the correctness of a computation. I will discuss both their practical aspects and their impact on quantum complexity, hardness of approximation, and the complexity of Nash equilibrium.

Bio: Yael Tauman Kalai received her BA (1997) from the Hebrew University in Jerusalem, MA (2001) under the supervision of Adi Shamir at the Weizmann Institute, and PhD (2006) under the supervision of Shafi Goldwasser at MIT. After postdoctoral positions at Microsoft Research and the Weizmann Institute, she is now a Principal Senior Researcher at Microsoft Research New England and an adjunct professor at MIT.  Her research focuses on cryptography.


_______________________________________________
talks mailing list
talks@lists.cs.princeton.edu
To edit subscription settings or remove yourself, use this link:
https://lists.cs.princeton.edu/mailman/listinfo/talks