Minimal Complexity Assumptions for Cryptography
Organizers:
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?
Registration is required to attend this workshop. Space may be limited, and you are advised to register early. The link to the registration form will appear on this page approximately 10 weeks before the workshop. To submit your name for consideration, please register and await confirmation of your acceptance before booking your travel.
Further details about this workshop will be posted in due course. To contact the organizers about this workshop, please complete this form.
Please note: the Simons Institute regularly captures photos and video of activity around the Institute for use in videos, publications, and promotional materials.
