![](/sites/default/files/styles/workshop_banner_sm_1x/public/complexity_logo_final.png.jpg?itok=H_SevtP4)
Abstract
I will briefly describe a couple of widely open research directions in Cryptography that are closely related to fine-grained Complexity. First, we will demonstrate the importance of exact hardness bounds through the notion of “proof of work.” Then we will wonder how Cryptographic hardness can be formed.