BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//ical.marudot.com//iCal Event Maker
CALSCALE:GREGORIAN
BEGIN:VTIMEZONE
TZID:Europe/Berlin
LAST-MODIFIED:20201011T015911Z
TZURL:http://tzurl.org/zoneinfo-outlook/Europe/Berlin
X-LIC-LOCATION:Europe/Berlin
BEGIN:DAYLIGHT
TZNAME:CEST
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
DTSTART:19700329T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:CET
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
DTSTART:19701025T030000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20220516T134523Z
UID:1652708595596-30790@ical.marudot.com
DTSTART;TZID=Europe/Berlin:20220518T170000
DTEND;TZID=Europe/Berlin:20220518T190000
SUMMARY:CISPA DLS / Huijia Lin – "How to Hide Secrets in Software?" 
DESCRIPTION:At least since the initial public proposal of public-key cryptography based on computational hardness assumptions (Diffie and Hellman\, 1976)\, cryptographers have contemplated the possibility of a “one-way compiler” that translates computer programs into “incomprehensible” ones that compute the same function. In this talk\, we will describe a mathematical formalization of this goal known as  indistinguishability obfuscation (iO). Over the past decade\, It has been demonstrated that iO is a fascinating and powerful tool that enables a host of new cryptographic goals and beyond. We then show how to construct iO based on three well-studied hardness assumptions. \n\nJoint work with Aayush Jain at CMU and Amit Sahai at UCLA. \n
LOCATION:https://cispa-de.zoom.us/j/93997221436?pwd=QlRzT3RPS2ZKM1BSRVEvc2xoV2R1dz09
END:VEVENT
END:VCALENDAR