BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Department of Computer Science - ECPv6.15.20//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Department of Computer Science
X-ORIGINAL-URL:https://www.cs.jhu.edu
X-WR-CALDESC:Events for Department of Computer Science
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20190310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20191103T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20200308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20201101T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20210314T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20211107T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20200324T104500
DTEND;TZID=America/New_York:20200324T114500
DTSTAMP:20260422T144804
CREATED:20210629T210723Z
LAST-MODIFIED:20210629T210723Z
UID:1962440-1585046700-1585050300@www.cs.jhu.edu
SUMMARY:Noah Stephens-Davidowitz\, Simons Institute – “Foundations of Lattice-Based Cryptography”
DESCRIPTION:LocationZoomAbstractThere 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.BioNoah 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.HostAbhishek Jain
URL:https://www.cs.jhu.edu/event/noah-stephens-davidowitz-simons-institute-foundations-of-lattice-based-cryptography/
END:VEVENT
END:VCALENDAR