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?
Benny Applebaum (Tel-Aviv University), Marshall Ball (NYU), Nir Bitansky (Tel-Aviv University), Andrej Bogdanov (University of Ottawa), Dan Boneh (Stanford University), Zvika Brakerski (Weizmann Institute of Science), Ran Canetti (Boston University), Lijie Chen (MIT), Kai-Min Chung (Academia Sinica), Dana Dachman-Soled (University of Maryalnd), Lalita Devidas (MIT), Vipul Goyal (NTT Research), Iftach Haitner (Tel Aviv University), Shuichi Hirahara (National Institute of Informatics, Tokyo), Justin Holmgren (Princeton University), Rahul Ilango (MIT), Russell Impagliazzo (UC San Diego), Yuval Ishai (Technion), Abhishek Jain (Johns Hopkins University), Zhengzhong Jin (MIT), Yael Kalai (MSR), Dakshita Khurana (University of Illinois Urbana-Champaign), Rachel Lin (University of Washington), Yanyi Liu (Cornell University), Alex Lombardi (MIT), Fermi Ma (Princeton University), Mohammad Mahmoody (University of Virginia), Hemanta Maji (UCLA), Tal Malkin (Columbia University), Noam Mazor (Tel-Aviv University), Moni Naor (Weizmann Institute of Science), Omer Paneth (Tel-Aviv University), Rafael Pass (Tel-Aviv University and Cornell Tech), Hanlin Ren (University of Oxford), Lior Rotem (Stanford University), Guy Rothblum (Apple), Ron Rothblum (Technion), Amit Sahai (UCLA), Rahul Santhanam (University of Oxford), Dana Shamir (Tel Aviv University), Abhi Shelat (Northeastern), Prashant Vasudevan (National University of Singapore), Ilya Volkovich (Boston College), Daniel Wichs (Northeastern University), Mark Zhandry (NTT Research)