Max-Planck-Institut für Informatik
max planck institut
informatik
mpii logo Minerva of the Max Planck Society
 

MPI-INF or MPI-SWS or Local Campus Event Calendar

<< Previous Entry Next Entry >> New Event Entry Edit this Entry Login to DB (to update, delete)
What and Who
Title:On Basing Size-Verifiable One-Way Functions on NP-Hardness
Speaker:Andrej Bogdanov
coming from:Chinese University of Hong Kong
Speakers Bio:Andrej Bogdanov is an associate professor at the Department of Computer Science and Engineering and associate director of the Institute of Theoretical Computer Science and Communications at the Chinese University of Hong Kong. He obtained his B.Sc. and M. Eng. degrees from MIT and his Ph.D. from UC Berkeley. He was a postdoctoral associate at the Institute for Advanced Study, DIMACS (Rutgers University), and ITCS (Tsinghua University) before joining CUHK in 2008. His research interests are in computational complexity, cryptography, and sublinear-time algorithms.
Event Type:CISPA Distinguished Lecture Series
Visibility:D1, D2, D3, D4, D5, SWS, RG1, MMCI
We use this to send out email in the morning.
Level:AG Audience
Language:English
Date, Time and Location
Date:Friday, 19 September 2014
Time:14:00
Duration:90 Minutes
Location:Saarbr├╝cken
Building:E1 7 - MMCI
Room:0.01
Abstract
We prove that if the hardness of inverting a size-verifiable one-way function can be based on NP-hardness via a general (adaptive) reduction, then coNP is contained in AM. This claim was made by Akavia, Goldreich, Goldwasser, and Moshkovitz (STOC 2006), but was later retracted (STOC 2010).

Based on joint work with Christina Brzuska.

Contact
Name(s):Isa Maurer
Phone:+49-681-30271922
EMail:--email address not disclosed on the web
Video Broadcast
Video Broadcast:NoTo Location:
Tags, Category, Keywords and additional notes
Note:
Attachments, File(s):
  • Isa Maurer, 09/17/2014 04:55 PM -- Created document.