Advisor-Verifier-Prover Games and the Hardness of Information Theoretic Cryptography

Benny Applebaum (Tel-Aviv University) https://simons.berkeley.edu/talks/benny-applebaum-tel-aviv-university-2023-05-04 Minimal Complexity Assumptions for Cryptography Note: This talk will be presented virtually. | For most cryptographic tasks the existence of one-way functions is known to be a necessary condition. Still, there are quite a few problems for which we currently cannot rule out the existence of efficient information-theoretic solution. In this talk, I will describe several examples and present a new hypothesis on the existence of certain proof systems that implies, in a unified way, the impossibility of efficient information-theoretic solutions for several important tasks.