BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Penn Engineering Events - ECPv6.15.18//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Penn Engineering Events
X-ORIGINAL-URL:https://seasevents.nmsdev7.com
X-WR-CALDESC:Events for Penn Engineering Events
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:20210223T150000
DTEND;TZID=America/New_York:20210223T160000
DTSTAMP:20260407T035554
CREATED:20210208T222031Z
LAST-MODIFIED:20210208T222031Z
UID:4145-1614092400-1614096000@seasevents.nmsdev7.com
SUMMARY:CIS Seminar: "Provably Secure Indistinguishability Obfuscation"
DESCRIPTION:Abstract: \nIn this talk\, we will cover some exciting progress on the problem of Indistinguishability Obfuscation (proposed by Barak et. al. 2001). In a nutshell\, an Indistinguishability Obfuscation scheme is an efficient compiler that takes as input a program and outputs a new program with the same input-behavior and only a polynomial slowdown\, but in addition\, we have the guarantee that the new program reveals minimal information about the original program.  \nIf realized securely and efficiently\, such an obfuscation scheme would have huge consequences to both theory and practice. However\, until now we did not know if it exists under any reasonably well-believed conjecture. Our work places iO onto “terra-firma”\, by giving a construction that is as secure as several well-studied mathematical problems that are widely believed to be extremely hard to solve.   \nIn this talk\, we will hear about indistinguishability obfuscation\, why it is useful\, how it can be constructed\, and future work.
URL:https://seasevents.nmsdev7.com/event/cis-seminar-provably-secure-indistinguishability-obfuscation/
LOCATION:Zoom – Email CIS for link\, cherylh@cis.upenn.edu
ORGANIZER;CN="Computer and Information Science":MAILTO:cherylh@cis.upenn.edu
END:VEVENT
END:VCALENDAR