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.

AG 1, AG 2, AG 3, AG 4, AG 5, SWS, RG1, MMCI   Info

AG Audience

English

90 Minutes

Saarbrücken

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.

Isa Maurer

+49-681-30271922

--email hidden

passcode not visible

logged in users only