![Meta-complexity_logo_hi-res](/sites/default/files/styles/workshop_banner_sm_1x/public/2023-02/Meta-complexity_hi-res.png.jpg?itok=oFqprXq1)
Abstract
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.