
About
This workshop will aim to capitalize on recent progress in meta-complexity to gain an improved understanding of questions such as: Can one-way functions be based on average-case hardness of NP? Is there a characterization of asymmetric-key cryptography by a standard complexity assumption? Can connections between meta-complexity and obfuscation be exploited to base obfuscation on more general assumptions? What kinds of connections exist among proof complexity, cryptography, and the theory of TFNP?
Chairs/Organizers