BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//hacksw/handcal//NONSGML v1.0//EN
BEGIN:VEVENT
UID:node-11567@prod.cs.cornell.edu
DTSTAMP:20210517T200000Z
DTSTART:20210517T200000Z
DTEND:20210517T210000Z
SUMMARY:Indistinguishability Obfuscation from Well-Founded Assumptions
DESCRIPTION:Rachel (Huijia) Lin, University of Washington. Indistinguishability Obfuscation from Well-Founded Assumptions (via Zoom)Abstract: Indistinguishability obfuscation, introduced by [Barak et. al. Crypto’2001], aims to compile programs into unintelligible ones while preserving functionality. It is a fascinating and powerful object that has been shown to enable a host of new cryptographic goals and beyond. However, constructions of indistinguishability obfuscation have remained elusive, with all other proposals relying on heuristics or newly conjectured hardness assumptions.In this work, we show how to construct indistinguishability obfuscation from the subexponential hardness of four well-founded assumptions. We prove:Theorem (Informal) Assume sub-exponential hardness of the following assumptions: the Learning With Errors (LWE) assumption with subexponential modulus-to-noise ratio, the Learning Parity with Noise (LPN) assumption with inverse polynomial error rate, the existence of a Boolean...https://prod.cs.cornell.edu/content/indistinguishability-obfuscation-well-founded-assumptions
LOCATION:Streaming via Zoom
END:VEVENT
END:VCALENDAR