University of Cambridge > Talks.cam > Microsoft Research Cambridge, public talks > On Basing One-Way Functions on NP-Hardness

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

On Basing One-Way Functions on NP-Hardness

Download to your calendar using vCal

If you have a question about this talk, please contact Microsoft Research Cambridge Talks Admins .

This event may be recorded and made available internally or externally via http://research.microsoft.com. Microsoft will own the copyright of any recordings made. If you do not wish to have your image/voice recorded please consider this before attending

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 NP is contained in coAM. This claim was made by Akavia, Goldreich, Goldwasser, and Moshkovitz (STOC 2006), but was later retracted (STOC 2010). This is joint work with Andrej Bogdanov.

This talk is part of the Microsoft Research Cambridge, public talks series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Average on Saturdays: 7545.24285714 kWh Department of Chemistry, Unilever Lecture Theatre Room S3, Alison Richard Building, Sidgwick Site, 7 West Road, CB3 9DT

Other talks

Caribbean Trip and Cacti Morning Break Title to be confirmed Wolfson Tool Factory Title to be confirmed Carrollian momenta from anti de Sitter
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity