BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CMSA - ECPv6.17.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:CMSA
X-ORIGINAL-URL:https://cmsa.fas.harvard.edu
X-WR-CALDESC:Events for CMSA
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: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
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20220313T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20221106T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20210423T160000
DTEND;TZID=America/New_York:20210423T183000
DTSTAMP:20250328T185338Z
CREATED:20230707T172354Z
LAST-MODIFIED:20250328T185338Z
UID:10000912-1619193600-1619202600@cmsa.fas.harvard.edu
SUMMARY:CMSA Math-Science Literature Lecture: Indistinguishability Obfuscation: How to Hide Secrets within Software
DESCRIPTION:Amit Sahai  (UCLA) \nTitle: Indistinguishability Obfuscation: How to Hide Secrets within Software \nAbstract: At least since the initial public proposal of public-key cryptography based on computational hardness conjectures (Diffie and Hellman\, 1976)\, cryptographers have contemplated the possibility of a “one-way compiler” that translates computer programs into “incomprehensible” but equivalent forms. And yet\, the search for such a “one-way compiler” remained elusive for decades. \nIn this talk\, we look back at our community’s attempts to formalize the notion of such a compiler\, culminating in our 2001 work with Barak\, Goldreich\, Impagliazzo\, Rudich\, Vadhan\, and Yang\, which proposed the notion of indistinguishability obfuscation (iO). Roughly speaking\, iO requires that the compiled versions of any two equivalent programs (with the same size and running time) be indistinguishable to any efficient adversary. Leveraging the notion of punctured programming\, introduced in our work with Waters in 2013\, well over a hundred papers have explored the remarkable power of iO. \nWe’ll then discuss the intense effort that recently culminated in our 2020 work with Jain and Lin\, finally showing how to construct iO in such a way that\, for the first time\, we can prove the security of our iO scheme based on well-studied computational hardness conjectures in cryptography. \nTalk chair: Sergiy Verstyuk \nVideo
URL:https://cmsa.fas.harvard.edu/event/cmsa-math-science-literature-lecture_sahai/
LOCATION:Virtual
CATEGORIES:Event,Math Science Literature Lecture Series,Public Lecture,Special Lectures
ATTACH;FMTTYPE=image/jpeg:https://cmsa.fas.harvard.edu/media/Lecture_Sahai-pdf.jpeg
END:VEVENT
END:VCALENDAR