Past Events

Faculty Candidate Talk

Foundations of Lattice-Based Cryptography


Download as iCal file

Monday, March 30, 2020, 10:30am


You can view this talk via Webex using the following information:

Meeting link:

Meeting number (access code): 795 645 718

Meeting password: piHBrPet273



Speaker: Noah Stephens-Davidowitz, Simons Institute in Berkeley


Noah Stephens-Davidowitz is the Microsoft Research Fellow at the Simons Institute in Berkeley. He has also been a postdoctoral researcher at MIT, Princeton, and the Institute for Advanced Study. He received his PhD from NYU,  where his dissertation won the Dean’s Outstanding Dissertation Award in the sciences.

Much of Noah’s research uses the tools of theoretical computer science to answer fundamental questions about the security of widely deployed real-world cryptography, particularly post-quantum lattice-based cryptography. He is also interested more broadly in theoretical computer science, cryptography, and geometry.

Location : Live-streamed via Webex

Event Type: Faculty Candidate Talk

Abstract: There has been a recent revolution in cryptography due to the introduction of lattice-based constructions. These are cryptographic schemes whose security relies on the presumed hardness of certain computational problems over ubiquitous (and beautiful) geometric objects called lattices. Their many applications (e.g., fully homomorphic encryption) and security against adversaries with quantum computers has created some urgency to deploy lattice-based schemes widely over the next few years. For example, the National Institute of Standards and Technology is in the process of standardizing lattice-based cryptography, and Google has already implemented such a scheme in its Canary browser.The security of the proposed schemes relies crucially on the assumption that our current best algorithms (both classical and quantum) for the relevant computational lattice problems cannot be improved by even a relatively small amount. I will discuss the state of the art in the study of this assumption. In particular, I will describe the fastest known algorithms for these problems (and potential directions to improve them) as well as a recent series of hardness results that use the tools of fine-grained complexity to provide strong evidence for the security of lattice-based cryptography.

Contact  Faculty Host: Shubhangi Saraf