BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:On Basing One-Way Functions on NP-Hardness  - Christina Brzuska\, 
 Microsoft Research Cambridge
DTSTART:20141105T100000Z
DTEND:20141105T110000Z
UID:TALK55789@talks.cam.ac.uk
CONTACT:Microsoft Research Cambridge Talks Admins
DESCRIPTION:We prove that if the hardness of inverting a size-verifiable o
 ne-way function can be based on NP-hardness via a general (adaptive) reduc
 tion\, then NP is contained in coAM. This claim was made by Akavia\, Goldr
 eich\, Goldwasser\, and Moshkovitz (STOC 2006)\, but was later retracted (
 STOC 2010). This is joint work with Andrej Bogdanov. 
LOCATION:Auditorium\, Microsoft Research Ltd\, 21 Station Road\, Cambridge
 \, CB1 2FB
END:VEVENT
END:VCALENDAR